#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=998244353;
int ksm(int x,ll y,int p=mod){
	int ans=1;y%=(p-1);
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}
int cmod(int x){if(x>=mod)x-=mod;return x;}

template<typename T>void cmax(T &x,T v){x=max(x,v);}
template<typename T>void cmin(T &x,T v){x=min(x,v);}

const int N=1e7+5;
const int K=105;
int f[K],ff[K],fn[N];
int n,k,m;

int fac[N],ifac[N],Inv[N];
void init(int V){
	fac[0]=1;for(int i=1;i<=V;i++)fac[i]=1ll*fac[i-1]*i%mod;
	ifac[V]=inv(fac[V])%mod;for(int i=V-1;i>=0;i--)ifac[i]=1ll*ifac[i+1]*(i+1)%mod;
	for(int i=1;i<=V;i++)Inv[i]=1ll*fac[i-1]*ifac[i]%mod;
}

signed main(void){

#ifndef ONLINE_JUDGE
	freopen("in.in","r",stdin);
#endif

	n=read(),k=read(),m=read();init(N-5);
	for(int i=0;i<=k;i++){f[i]=read();f[i]=1ll*read()*inv(10000)%mod;}
	for(int i=1;i<=k;i++)ff[i-1]=1ll*i*f[i]%mod;
	
//	cout<<"f = ";for(int i=0;i<=k;i++)cout<<f[i]<<" \n"[i==k];
	
	fn[0]=ksm(f[0],n);int Iv=inv(f[0]);
//	cout<<"f^n "<<0<<" = "<<fn[0]<<endl;
	for(int t=0;t<=m-1;t++){
		int res=0;
		for(int i=0;i<=min(t,k-1);i++)add(res,1ll*ff[i]*fn[t-i]%mod);
//		cout<<"res = "<<res<<endl;
		res=1ll*res*n%mod;
//		cout<<" res = "<<res<<endl;
		for(int i=1;i<=min(t,k);i++)add(res,mod-1ll*f[i]*(t-i+1)%mod*fn[t-i+1]%mod);
//		cout<<"  res = "<<res<<endl;
		res=1ll*res*Iv%mod;fn[t+1]=1ll*res*Inv[t+1]%mod;
		
//		cout<<" -> f^n "<<t+1<<" = "<<fn[t+1]<<endl;
	}
	
	int ans=0,pr=0;
	for(int i=0;i<=m;i++)add(ans,1ll*fn[i]*i%mod),add(pr,fn[i]);
	add(ans,1ll*m*(mod+1-pr)%mod);
	
	cout<<ans<<endl;

	return 0;
}