#include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define SZ(x) ((int)x.size()-1)
#define ms(a,b) memset(a,b,sizeof a)
#define F(i,a,b) for (int i=(a);i<=(b);++i)
#define DF(i,a,b) for (int i=(a);i>=(b);--i)
//#define mp make_pair
//#define OO(x) fixed<<setprecision(x)
using namespace std;
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int read(){
	char ch=getchar(); int w=1,c=0;
	for(;!isdigit(ch);ch=getchar()) if (ch=='-') w=-1;
	for(;isdigit(ch);ch=getchar()) c=(c<<1)+(c<<3)+(ch^48);
	return w*c;
}
const int mod=998244353;//?????????

LL fast(LL x,LL p){
	LL ret=1;
	for (;p;p>>=1,x=x*x%mod) if (p&1) ret=ret*x%mod;
	return ret;
}
const int M=1e7+10;
LL iv[M];
void init(int n){
	iv[1]=1;
	F(i,2,n) iv[i]=(mod-mod/i)*iv[mod%i]%mod;
}

int k,n,lim;
LL f[555],ff[555],g[M*10];
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	k=read(); n=read()+1; lim=read(); init(lim);
	
	F(i,0,n-1){
		double x;
		cin>>x;
		f[i]=(LL)round(x*10000.0)*fast(10000,mod-2)%mod;
//		cerr<<round(x*10000.0)<<" !!!\n";
//		cerr<<f[i]<<"\n";
	}
	F(i,0,n-2) ff[i]=f[i+1]*(i+1)%mod*k%mod;
	g[0]=fast(f[0],k);	LL prob=g[0],ans=0;
	LL inv=fast(f[0],mod-2);
	F(i,1,lim){
		LL tmp=0,lt=0;
		//i-1
		F(j,1,n-1) if (i-j>=0) tmp=(tmp+f[j]*g[i-j]%mod*(i-j))%mod;
		F(j,0,n-2) if (i-1-j>=0) lt=(lt+ff[j]*g[i-1-j])%mod;
		g[i]=(lt+mod-tmp)*iv[i]%mod*inv%mod;
		ans=(ans+g[i]*i)%mod;
		prob=(prob+g[i])%mod;
	}
	ans=(ans+(mod+1-prob)*lim)%mod;
	cout<<ans<<"\n";
	return 0;
}
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/