#include<bits/stdc++.h>
#define P pair<int,int>
#define fi first
#define se second
#define LL long long
#define fr(x) freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);
using namespace std;
const int N=1e7+5,mod=998244353;
int n,K,x,a[105],b[N],I[N];long double X;
inline int md(int x){return x>=mod?x-mod:x;}
inline int ksm(int x,int p){int s=1;for(;p;(p&1)&&(s=1ll*s*x%mod),x=1ll*x*x%mod,p>>=1);return s;}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);cin>>n>>K>>x;
	for(int i=0,y;i<=K;i++) cin>>X,y=round(X*10000),a[i]=796898467ll*y%mod;
	I[1]=1;for(int i=2;i<=x;i++) I[i]=mod-1ll*I[mod%i]*(mod/i)%mod;
	b[0]=ksm(a[0],n);int inv=ksm(a[0],mod-2);
	for(int i=0;i<x;i++)
	{
		int s=0;
		for(int j=1;j<=K&&j<=i+1;j++) s=(s+(1ll*(n+1)*j%mod-i-1+mod)*a[j]%mod*b[i-j+1])%mod;
		b[i+1]=1ll*s*inv%mod*I[i+1]%mod;
	}
	int t=1,ans=0;
	for(int i=0;i<x;i++) ans=(ans+1ll*i*b[i])%mod,t=md(t-b[i]+mod);
	return cout<<(ans+1ll*t*x)%mod,0;
}