#include<bits/stdc++.h>
using namespace std;
int read()
{
	int x=0,f=1;
	char ch=getchar();
	for(;!isdigit(ch);ch=getchar()) if(ch=='-') f=-1;
	for(;isdigit(ch);ch=getchar()) x=x*10+ch-'0';
	return x*f;
}
const int mod=998244353;
const int maxN=31;
const int maxM=105;
int fact[maxN],inv_fact[maxN];
int fpow(int x,int y)
{
	int res=1;
	while(y)
	{
		if(y&1) res=(long long)res*x%mod;
		x=(long long)x*x%mod;
		y>>=1;
	}
	return res;
}
int inv(int x)
{
	return fpow(x,mod-2);
}
int v[maxM];
int pow_v[maxM][maxN];
int f[maxM][maxN][maxN][maxN];
void inc(int &x,int y)
{
	x+=y;
	if(x>mod) x-=mod;
}
int spopcount(int x)
{
	int res=0;
	while(x)
	{
		res++;
		x-=x&(-x);
	}
	return res;
}
int main()
{
	int n=read(),m=read(),K=read();
	fact[0]=1;
	for(int i=1;i<=n;i++) fact[i]=(long long)fact[i-1]*i%mod;
	inv_fact[n]=inv(fact[n]);
	for(int i=n-1;i>=0;i--) inv_fact[i]=(long long)inv_fact[i+1]*(i+1)%mod;
	for(int i=0;i<=m;i++) v[i]=read();
	for(int i=0;i<=m;i++)
	{
		pow_v[i][0]=1;
		for(int j=1;j<=n;j++) pow_v[i][j]=(long long)pow_v[i][j-1]*v[i]%mod;
	}
	for(int i=0;i<=n;i++) f[0][i][i/2][i&1]=(long long)inv_fact[i]*pow_v[0][i]%mod;
	for(int i=1;i<=m;i++) //f[i][j][k][l] i j个 进位k l个1
		for(int j=0;j<=n;j++)
			for(int k=0;k<=n/2;k++)
				for(int l=0;l<=min(i,K);l++)
					for(int x=0;j+x<=n;x++)
						inc(f[i][j+x][(x+k)/2][l+((x+k)&1)],(long long)inv_fact[x]*pow_v[i][x]%mod*f[i-1][j][k][l]%mod);
	int ans=0;
	for(int i=0;i<=n/2;i++)
	{
		int tmp=spopcount(i);
		for(int j=0;j+tmp<=K;j++) inc(ans,f[m][n][i][j]);
	}
	ans=(long long)ans*fact[n]%mod;
	printf("%d\n",ans);
	return 0;
}