#include<iostream>
#include<cstdio>
#define N 16
#define mod 998244353
using namespace std;
long long read()
{
    char c=0;
    long long sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
void Adder(int &x,int d)
{
    x+=d;
    if (x>=mod) x-=mod;
    return;
}
void Adder2(int &x,int d)
{
    x+=d;
    if (x<0) x+=mod;
    return;
}
int lowbit(int x)
{
    return x&(-x);
}
int n,m,ans,tong[N+1],length,sz[1<<N],F[1<<N],G[1<<N],miner[1<<N],delta[1<<N],delta2[1<<N],dp[N+1][2],dp2[N+1][2];
long long a[N+1],c;
bool E[N+1][N+1];
void dfs(int x,int st,int res)
{
    if (!x)
    {
	Adder(ans,1ll*delta[st]*res%mod);
	return;
    }
    for (int i=x;i>0;i=(i-1)&x)
	if ((sz[i]&1)&&lowbit(i)==lowbit(x))
	    dfs(x^i,st|(1<<(miner[i]-1)),1ll*res*G[i]%mod);
    return;
}
int main()
{
    //freopen("graph.in","r",stdin);
    //freopen("graph.out","w",stdout);
    int x,y,cnt;
    n=read(),m=read(),c=read();
    for (int i=1;i<(1<<n);++i) sz[i]=sz[i-lowbit(i)]+1;
    for (int i=1;i<=n;++i) a[i]=read();
    for (int i=1;i<=m;++i) x=read(),y=read(),E[x][y]=E[y][x]=1;
    for (int i=0;i<(1<<n);++i)
    {
	F[i]=1;
	for (int j=1;j<=n;++j)
	    if (i&(1<<(j-1)))
		for (int k=j+1;k<=n;++k)
		    if ((i&(1<<(k-1)))&&E[j][k])
			F[i]=0;
    }
    for (int i=0;i<(1<<n);++i)
    {
	G[i]=F[i];
	for (int j=i;j>0;j=(j-1)&i)
	    if (lowbit(i)==lowbit(i^j))
		Adder2(G[i],-1ll*F[j]*G[i^j]%mod);
    }
    for (int i=0;i<(1<<n);++i)
	for (int j=1;j<=n;++j)
	    if ((i&(1<<(j-1)))&&(!miner[i]||a[j]<a[miner[i]]))
		miner[i]=j;
    for (int i=0;i<(1<<n);++i)
    {
	length=0;
	for (int j=1;j<=n;++j)
	    if (i&(1<<(j-1)))
		tong[++length]=a[j];
	for (int j=59;j>=0;--j)
	{
	    for (int k=0;k<=length+1;++k) dp[k][0]=dp[k][1]=dp2[k][0]=dp2[k][1]=0;
	    dp[0][0]=dp2[length+1][0]=1,cnt=0;
	    for (int k=1;k<=length;++k)
		for (int op=0;op<=1;++op)
		{
		    if (tong[k]&(1ll<<j))
		    {
			Adder(dp[k][op],1ll*dp[k-1][op]*((1ll<<j)%mod)%mod);
			Adder(dp[k][op^1],1ll*dp[k-1][op]*(((tong[k]&((1ll<<j)-1))+1)%mod)%mod);
		    }
		    else Adder(dp[k][op],1ll*dp[k-1][op]*(((tong[k]&((1ll<<j)-1))+1)%mod)%mod);
		}
	    for (int k=length;k>=1;--k)
		for (int op=0;op<=1;++op)
		{
		    if (tong[k]&(1ll<<j)) Adder(dp2[k][op^1],1ll*dp2[k+1][op]*(((tong[k]&((1ll<<j)-1))+1)%mod)%mod);
		    else Adder(dp2[k][op],1ll*dp2[k+1][op]*(((tong[k]&((1ll<<j)-1))+1)%mod)%mod);
		}
	    for (int k=1;k<=length;++k)
		if (tong[k]&(1ll<<j))
		{
		    for (int op=0;op<=1;++op) Adder(delta[i],1ll*dp[k-1][op]*dp2[k+1][op^((c>>j)&1)]%mod);
		    cnt++;
		}
	    if ((cnt&1)!=((c>>j)&1)) break;
	    if (!j) Adder(delta[i],1);
	}
    }
    delta2[0]=1;
    for (int i=0;i<(1<<n);++i)
	for (int j=i;j>0;j=(j-1)&i)
	    if (!(sz[j]&1)&&lowbit(i)==lowbit(j))
		Adder(delta2[i],1ll*delta2[i^j]*(a[miner[j]]+1)%mod*G[j]%mod);
    for (int i=0;i<(1<<n);++i)
	if (!(sz[i]&1))
	    dfs(((1<<n)-1)^i,0,delta2[i]);
    printf("%d\n",ans);
    return 0;
}