#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=3e2+5,M=(1<<15)+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
int n,m,pl[N],e[N][N];
ll C,A[N],B[N];
ll w[M],es[M],f[N],pw[N],iw[N];
ll calc(int x){
	ll tot=0;
	for(int i=60;~i;i--){
		ll t=1;int op=0;
		static ll f[2],g[2];
		Me(f,0);f[0]=1;
		for(int j=1;j<=n;j++) if(x>>j-1&1){
			t=(B[j]&(1ll<<i)-1)%mod*t%mod;
			if(B[j]>>i&1){
				op^=1;
				Mc(g,f);ll w1=pw[i],w2=(B[j]&(1ll<<i)-1)%mod;
				f[0]=(g[0]*w1+g[1]*w2)%mod;
				f[1]=(g[0]*w2+g[1]*w1)%mod;
			}else{
				ll w=(B[j]&(1ll<<i)-1)%mod;
				f[0]=f[0]*w%mod;f[1]=f[1]*w%mod;
			}
		}
		if(op^(C>>i&1)){tot+=f[C>>i&1]*iw[i]%mod;break;}
		tot+=(f[op]-t)*iw[i]%mod;
	}
	return (tot%mod+mod)%mod;
}
void Solve(){
	int i,j,h;scanf("%d%d%lld",&n,&m,&C);
	for(i=1;i<=n;i++) scanf("%lld",&A[i]),A[i]++;
	iota(B+1,B+n+1,1);sort(B+1,B+n+1,[](int x,int y){return A[x]<A[y];});
	for(i=1;i<=n;i++) pl[B[i]]=i,B[i]=A[B[i]];
	while(m--){
		int x,y;scanf("%d%d",&x,&y);
		x=pl[x];y=pl[y];
		e[x][y]=e[y][x]=1;
	}
	for(i=0;i<(1<<n);i++){
		es[i]=1;for(j=1;j<=n;j++) if(i>>j-1&1) for(h=1;h<=n;h++) if(i>>h-1&1&&e[j][h]) es[i]=0;
		w[i]=es[i];
		for(j=i&(i-1);j;j=(j-1)&i) if((j&-j)==(i&-i)) w[i]-=w[j]*es[i^j];
		w[i]=(w[i]%mod+mod)%mod;
		// gdb(i,w[i]);
	}
	f[(1<<n)-1]=1;
	for(i=1;i<=n;i++){
		for(j=0;j<(1<<n);j++) if(j>>i-1&1&&f[j]){
			int p=(j>>i)<<i;
			for(h=p;h;h=(h-1)&p){
				if(__builtin_parity(h)) f[j^h^(1<<i-1)]=(f[j^h^(1<<i-1)]+f[j]*w[h|(1<<i-1)]%mod*B[i]%mod)%mod;
				else f[j^h]=(f[j^h]+f[j]*w[h|(1<<i-1)])%mod;
			}
		}
	}
	for(pw[0]=iw[0]=i=1;i<=60;i++) pw[i]=pw[i-1]*2%mod,iw[i]=iw[i-1]*(mod+1)/2%mod;
	ll tot=0;for(i=0;i<(1<<n);i++) if(f[i]) tot+=calc(i)*f[i]%mod/*,gdb(i,f[i],calc(i))*/;
	printf("%lld\n",tot%mod);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}