#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int mod=998244353;
#define int long long
inline int qpow(int a,int b){
    int ret=1;
    while(b){
        if(b&1) ret=ret*a%mod;
        a=a*a%mod;b>>=1;
    }return ret;
}
const int N=15;
int n,m,c;
int a[N],A[N];
// vector<int>dp[(1<<15)+10];
int dp[(1<<13)+1][(1<<13)+1];
int ban[(1<<15)+10];
#define rep(i,l,r) for(int i=l;i<=r;i++)
inline int solve(int s){
    vector<int>b;
    int ans=0;
    int sum=0;
    for(int i=0;i<n;i++)
        if((s>>i)&1) b.push_back(a[i]),sum^=a[i];
    if(sum==c) ans++;
    for(int i=60;i>=0;i--){
        int sum=0;
        for(int x:b)sum^=((x>>(i+1)));
        if(sum==(c>>(i+1))){
            static int f[2][2],g[2][2];
            memset(f,0,sizeof(f));
            f[0][0]=1;
            for(int x:b){
                if((x>>i)&1){
                    int s0=(1ll<<i)%mod;
                    int s1=(x&((1ll<<i)-1))+1;s1%=mod;
                    g[0][0]=f[0][1]*s1;
                    g[0][1]=f[0][0]*s1;
                    g[1][0]=f[1][0]*s0+f[1][1]*s1+f[0][0];
                    g[1][1]=f[1][1]*s0+f[1][0]*s1+f[0][1];
                    rep(u,0,1)rep(v,0,1) f[u][v]=g[u][v]%mod;
                }else{
                    int cur=(x&((1ll<<i)-1))+1;cur%=mod;
                    rep(u,0,1)rep(v,0,1) f[u][v]=f[u][v]*cur%mod;
                }
            }
            ans+=f[1][(c>>i)&1];
            ans%=mod;
        }
    }return ans;
}
inline void dec(int &x){
    x-=(x>=mod?mod:0);
}
int g[(1<<N)+10],h[(1<<N)+10];
int32_t main(){

    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    cin>>n>>m>>c;
    for(int i=0;i<n;i++) cin>>a[i];
    static int p[N],q[N];
    for(int i=0;i<n;i++) p[i]=i;
    sort(p,p+n,[&](int u,int v){
        return a[u]<a[v];
    });
    for(int i=0;i<n;i++) q[p[i]]=i;
    sort(a,a+n);
    for(int i=1;i<=m;i++){
        int x,y;cin>>x>>y;x--,y--;
        ban[(1<<q[x])+(1<<q[y])]=1;
    }
    for(int mid=1;mid<(1<<n);mid<<=1){
        for(int j=0;j<(1<<n);j+=(mid<<1))
            for(int k=0;k<mid;k++)ban[j+k+mid]+=ban[j+k];
    }
    g[0]=1;
    for(int s=1;s<(1<<n);s++){
        int i=__builtin_ctz(s);
        int res=0;
        if(ban[s]) res=0;
        else res=1;
        // if(s==3)
        // cerr<<"?? "<<ban[3]<<" "<<res<<endl;
        for(int z=s;z;z=(z-1)&s){
            if(z==s) continue;
            if(__builtin_ctz(z)==i){
                if(!ban[s^z]) res-=g[z],res%=mod;
        // cerr<<"? "<<i<<" "<<s<<" "<<z<<"  "<<g[z]<<" "<<res<<endl;
            }
        }g[s]=res;
    }
    dp[0][0]=1;
    // cerr<<"? "<<ban[7]<<" "<<ban[1]<<" "<<ban[2]<<endl;exit(0);
    for(int i=0;i<n;i++){
        for(int s=0;s<(1<<n);s++){
            if((s&((1<<i)-1))==(1<<i)-1&&!((s>>i)&1)){
                int U=((1<<n)-1)^(s+(1<<i));
                int S=((1<<n)-1)^s;
                for(int u=U;;u=(u-1)&U){
                    int c=S^u;
                    if(__builtin_parity(c)){
                        for(int z=s;;z=(z-1)&s){
                            // cerr<<"? "<<s<<" "<<z<<" "<<dp[s][z]<<" "<<c<<" "<<k<<"|"<<dp[7][1]<<endl;
                            (dp[s|c][z|(1<<i)]+=g[c]*dp[s][z])%=mod;
                            if(!z) break;
                        }
                    }else{
                        for(int z=s;;z=(z-1)&s){
                            (dp[s|c][z]+=g[c]*dp[s][z]%mod*(a[i]+1))%=mod;
                            if(!z) break;
                        }
                    }
                    
                    if(!u) break;
                }
            }
        }
    }
    int ans=0;
    int s=(1<<n)-1;
    // cerr<<"======\n";
    for(int u=0;u<(1<<n);u++){
        // cerr<<"? "<<u<<" "<<dp[s][u]<<" "<<solve(u)<<endl;
        (ans+=dp[s][u]*solve(u))%=mod;
    }
    cout<<ans;
}