#include <cstdio>
#include <unordered_map>
using namespace std;
template<typename T>
T read(){
	char c=getchar();T x=0;
	while(c<48||c>57) c=getchar();
	do x=(x<<1)+(x<<3)+(c^48),c=getchar();
	while(c>=48&&c<=57);
	return x;
}
const int N=33,S=1<<15,LG=63,P=998244353;
typedef long long ll;
int n,m,rk;ll c;
ll a[N],lis[N];
bool ban[S];
int coe[S],pos[S];
void inc(int &x,int v){if((x+=v)>=P) x-=P;}
void dec(int &x,int v){if((x-=v)<0) x+=P;}
unordered_map<int,int> f[S];
int suf[N][2];
bool sta[LG];
int main(){
	n=read<int>();m=read<int>();c=read<ll>();
	for(int i=0;i<n;++i) a[i]=read<ll>();
	for(int i=0;i<m;++i){
		int u=read<int>()-1,v=read<int>()-1;
		ban[(1<<u)|(1<<v)]=1;
	}
	for(int i=1;i<(1<<n);i<<=1)
		for(int j=0;j<(1<<n);j+=(i<<1))
			for(int k=j;k<(j|i);++k) ban[k|i]|=ban[k];
	for(int s=1;s<(1<<n);++s){
		int lb=__builtin_ctz(s);
		int _s=s^(1<<lb);
		pos[s]=lb;
		if(_s&&a[pos[_s]]<a[lb]) pos[s]=pos[_s];
		coe[s]=!ban[s];
		for(int _t=_s;;_t=(_t-1)&_s){
			int t=_t|(1<<lb);
			if(t!=s&&!ban[s^t]) dec(coe[s],coe[t]);
			if(!_t) break;
		}
	}
	f[0][0]=1;
	for(int s=1;s<(1<<n);++s){
		int lb=__builtin_ctz(s);
		int _s=s^(1<<lb);
		for(int _t=_s;;_t=(_t-1)&_s){
			int t=_t|(1<<lb);
			for(auto [x,val]:f[s^t])
				if(__builtin_parity(t)) inc(f[s][x|(1<<pos[t])],(ll)coe[t]*val%P);
				else inc(f[s][x],(a[pos[t]]+1)%P*val%P*coe[t]%P);
			if(!_t) break;
		}
	}
	int res=0;
	for(auto [s,val]:f[(1<<n)-1]){
		rk=0;
		for(int i=0;i<n;++i)
			if(s>>i&1) lis[rk++]=a[i];
		int ans=0;
		for(int t=59;~t;--t){
			suf[rk][0]=1;suf[rk][1]=0;
			for(int i=rk-1;~i;--i){
				sta[i]=lis[i]>>t&1;
				if(sta[i]){
					lis[i]^=(1ll<<t);
					suf[i][0]=((1ll<<t)%P*suf[i+1][0]+(lis[i]+1)%P*suf[i+1][1])%P;
					suf[i][1]=((1ll<<t)%P*suf[i+1][1]+(lis[i]+1)%P*suf[i+1][0])%P;
				}
				else{
					suf[i][0]=(lis[i]+1)%P*suf[i+1][0]%P;
					suf[i][1]=(lis[i]+1)%P*suf[i+1][1]%P;
				}
			}
			int par=(c>>t&1),cur=1;
			for(int i=0;i<rk;++i){
				if(sta[i]){
					ans=(ans+(ll)cur*suf[i+1][par])%P;
					par^=1;
				}
				cur=(ll)cur*(lis[i]+1)%P;
			}
			if(par) break;
			if(!t) ++ans;
		}
		res=(res+(ll)ans*val)%P;
	}
	printf("%d\n",res);
	return 0;
}