#include<algorithm>
#include<cstring>
#include<cstdio>
#define ll long long
#define qwq 23
const int mod=998244353;
inline void Mod(ll &x){
	if(x>=mod)x-=mod;
	if(x<0)x+=mod;
}
inline void Modint(int &x){
	if(x>=mod)x-=mod;
	if(x<0)x+=mod;
}
inline ll mpow(ll x,ll k){
	ll ans=1;
	for(;k;k=k>>1,x=x*x%mod){
		if(k&1)ans=ans*x%mod;
	}
	return ans;
}
int n,m;
ll C;
ll a[qwq];
struct Edge{
	int a,b;
}e[qwq*qwq];
ll f[1<<16|7]; 
ll presum[qwq],sufsum[qwq][2];
const int MaxBit=60;
inline ll get_f(int S){
	ll ans=0;
	for(int bit=MaxBit;bit>=0;--bit){
		ll sum=0;
		for(int i=1;i<=n;++i){
			if(!(S&(1<<(i-1))))continue;
			sum=sum^(a[i]>>bit);
		}
//		printf("%d:%lld\n",bit,sum);
		sufsum[n+1][0]=1;sufsum[n+1][1]=0;
		for(int i=n;i>=1;--i){
			sufsum[i][0]=sufsum[i+1][0];
			sufsum[i][1]=sufsum[i+1][1];
			if(!(S&(1<<(i-1))))continue;
			ll val=(a[i]&((1ll<<bit)-1))+1; 
			val%=mod;
//			printf("val:%d:%lld\n",i,val);
			ll tmp0=sufsum[i+1][0];
			ll tmp1=sufsum[i+1][1];
			if((a[i]>>bit)&1){
				sufsum[i][0]=tmp1*val;
				sufsum[i][1]=tmp0*val;
				val=1ll<<bit;val%=mod;
				sufsum[i][0]=(sufsum[i][0]+tmp0*val)%mod;
				sufsum[i][1]=(sufsum[i][1]+tmp1*val)%mod;
			}
			else {
				sufsum[i][0]=tmp0*val%mod;
				sufsum[i][1]=tmp1*val%mod;
			}
		}
		presum[0]=1;
		int w=(C>>bit)&1;
		for(int i=1;i<=n;++i){
			presum[i]=presum[i-1];
			if(!(S&(1<<(i-1))))continue;
			ll val=((a[i]&((1ll<<bit)-1))+1)%mod;
			presum[i]=presum[i]*val%mod;
//			printf("%d:%lld %lld %lld\n",i,presum[i-1],sufsum[i+1][0],sufsum[i+1][1]);
			if((a[i]>>bit)&1){
				ans+=presum[i-1]*sufsum[i+1][w]%mod;
				Mod(ans);
			}
			w^=(a[i]>>bit)&1;
		}
//		printf("nowans:%lld\n",ans);
		if(sum!=(C>>bit)){
			return ans;
		}
	}
	++ans;Mod(ans);
	return ans;
}
inline int lowbit(int x){
	return x&(-x);
}
int mina[1<<16|7];
int tmp[1<<16|7];
int g[1<<16|7];
int h[1<<16|7];
int To3[1<<16|7];
int dp[20000007];
int ppc[1<<16|7];
int main(){
	scanf("%d%d%lld",&n,&m,&C);
	for(int i=1;i<=n;++i){
		scanf("%lld",&a[i]);
		mina[1<<(i-1)]=i;
	}
	for(int i=1;i<=m;++i){
		scanf("%d%d",&e[i].a,&e[i].b);
		++tmp[(1<<(e[i].a-1))|(1<<(e[i].b-1))];
	}
	for(int S=1;S<(1<<n);++S){
		f[S]=get_f(S);
		ppc[S]=ppc[S^lowbit(S)]+1;
		for(int i=n;i>=1;--i){
			To3[S]=To3[S]*3;
			if(S&(1<<(i-1))){
				++To3[S];
			}
		}
		if(S==lowbit(S))continue;
		mina[S]=mina[lowbit(S)];
		if(a[mina[S^lowbit(S)]]<a[mina[S]]){
			mina[S]=mina[S^lowbit(S)];
		}
	}
	for(int mid=1;mid<(1<<n);mid=mid<<1){
		int len=(mid<<1);
		for(int i=0;i<(1<<n);i+=len){
			for(int k=0;k<mid;++k){
				tmp[i+k+mid]+=tmp[i+k];
			}
		}
	}
	for(int S=0;S<(1<<n);++S){
		if(tmp[S]==0)tmp[S]=1;
		else tmp[S]=0;
		g[S]=tmp[S];
		for(int s1=(S-1)&S;s1;s1=(s1-1)&S){
			if(s1&lowbit(S))continue;
			g[S]=(1ll*g[S]-1ll*g[S^s1]*tmp[s1])%mod;
			Modint(g[S]);
		}
		h[S]=1ll*g[S]*(a[mina[S]]%mod+1)%mod;
//		printf("S:%d g:%lld mina:%d\n",S,g[S],mina[S]);
	}
//	printf("OK\n");
//	return 0;
	int nS=(1<<n)-1;
	dp[0]=1;
	int w=0,Lim=0,TS=0,nows=0,toS=0;
	for(int S=0;S<(1<<n)-1;++S){
		for(int s1=S;;s1=(s1-1)&S){
			w=lowbit(nS^S);
			Lim=nS^S^w;
			TS=To3[S]+To3[s1];
			for(int s2=Lim;;s2=(s2-1)&Lim){
				nows=s2^w;
				toS=To3[S^nows]+To3[s1];
				if(ppc[nows]&1){
					toS+=To3[(1<<(mina[nows]-1))];
					dp[toS]=(1ll*dp[TS]*g[nows]+dp[toS])%mod;
				}
				else {
					dp[toS]=(1ll*dp[TS]*h[nows]+dp[toS])%mod;
				}
				if(s2==0)break;
			}
			if(s1==0)break;
		}
	}
	ll ans=0;
	for(int S=0;S<(1<<n);++S){
//		printf("S:%d %lld %lld\n",S,f[S],dp[(1<<n)-1][S]);
		ans+=f[S]*dp[To3[(1<<n)-1]+To3[S]]%mod;
		Mod(ans);
//		printf("nowans:%lld\n",ans%mod);
	}
	printf("%lld\n",ans);
	return 0;
}