#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
using namespace std;
const int N=17,S=(1<<15)+10,mod=998244353;
int n,m,p[N],id[N];ll c,a[N],pw[N],ipw[N];
void upd(ll &x,ll y){x=(x+y)%mod;}
ll qpow(ll a,int x){ll res=1;for(;x;x>>=1,a=a*a%mod) if(x&1) res=res*a%mod;return res;} 
ll inv(ll a){return qpow(a,mod-2);}
vector<ll> vs;
ll calc(){
    ll res=0,ans,f[2],g[2];
    per(i,60,0){
        f[0]=1;f[1]=0;int s=0,nc=(c>>i)&1;ans=1;
        for(ll val:vs){
            g[0]=f[0];g[1]=f[1];
            if((val>>i)&1){
                ++s;
                f[0]=(g[1]*pw[i]%mod+g[0]*((val&(1<<i)-1)%mod+1)%mod)%mod;
                f[1]=(g[0]*pw[i]%mod+g[1]*((val&(1<<i)-1)%mod+1)%mod)%mod;
            }
            else{
                f[0]=g[0]*((val&(1<<i)-1)%mod+1)%mod;
                f[1]=g[1]*((val&(1<<i)-1)%mod+1)%mod;
            }
            ans=ans*((val&(1<<i)-1)%mod+1)%mod;
        }
        upd(f[0],mod-ans);
        if(s) upd(res,f[nc^(s&1)]*ipw[i]%mod);
        if((s&1)!=nc) break;
        if(!i) ++res;
    }
    return res;
}
ll f[S],g[S],h[S],lh[S],ans;
int main(){
    scanf("%d%d%lld",&n,&m,&c);
    pw[0]=ipw[0]=1;rep(i,1,n) pw[i]=pw[i-1]*2%mod,ipw[i]=ipw[i-1]*(mod+1)/2%mod,scanf("%lld",a+i);
    iota(p+1,p+n+1,1);sort(p+1,p+n+1,[&](int x,int y){return a[x]<a[y];});rep(i,1,n) id[p[i]]=i;
    sort(a+1,a+n+1);
    int u,v;while(m--) scanf("%d%d",&u,&v),g[(1<<(id[u]-1))|(1<<(id[v]-1))]=1;
    rep(i,0,n-1) rep(j,0,(1<<n)-1) if(j>>i&1) g[j]|=g[j^(1<<i)];
    rep(i,0,(1<<n)-1) g[i]^=1;
    rep(i,1,(1<<n)-1){
        f[i]=g[i];
        for(int j=i&(i-1),jj=j;j;j=(j-1)&jj) upd(f[i],g[j]*(mod-f[i^j])%mod);
    }
    h[0]=1;
    rep(i,1,n){
        memcpy(lh,h,sizeof(h));memset(h,0,sizeof(h));
        rep(s,0,(1<<n)-1)
            if(s>>(i-1)&1) upd(h[s^(1<<i-1)],lh[s]);
            else{
                int sq=(s^((1<<n)-1))&((1<<n)-(1<<i));
                for(int j=sq;;j=(j-1)&sq){
                    int t=j|s;ll nr=lh[s]*f[j|(1<<i-1)]%mod;
                    if(__builtin_parity(j)) upd(h[t],(a[i]+1)%mod*nr%mod);
                    else upd(h[t|(1<<i-1)],nr);
                    if(!j) break;
                }
            }
    }
    rep(i,0,(1<<n)-1) if(h[i]){vs.clear();rep(j,1,n) if(i>>(j-1)&1) vs.push_back(a[j]);upd(ans,h[i]*calc()%mod);}
    printf("%lld\n",ans);
    return 0;
}