#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define dwn(i,a,b) for(int i=a;i>=b;i--)
#define lowbit(x) (x&(-x))
#define MAXN 302501
using namespace std;
typedef long long ll;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch>'9' || ch<'0'){if(ch=='-') f=-1; ch=getchar();}
	while('0'<=ch && ch<='9') x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
	return x*f;
}
const int mod=998244353;
int n,m,cc,a[MAXN],t[MAXN],sa[MAXN],st[MAXN],mul[MAXN]; 
int f[205][MAXN],g[205][MAXN],ans;
int ksm(int x,int y){
	int res=1;
	while(y){
		if(y&1) res=res*x%mod;
		x=x*x%mod;
		y>>=1;
	}
	return res;
}
void Add(int &x,int y){
	x += y;
	if(x >= mod) x -= mod;
	if(x < 0) x += mod;
}
void pre(){
	mul[0] = 1;
	rep(i,1,205) mul[i] = mul[i-1] * 2 % mod;
}
int main(){
	pre();
	cc = read(); n = read(); m = read();
	rep(i,1,n) a[i] = read(), sa[i] = sa[i-1] + a[i];
	rep(i,1,n) t[i] = read(), st[i] = st[i-1] + t[i];
	if(st[n] <= m){
		printf("%lld",1ll * mul[n] * sa[n] % mod);
		return 0;
	}
	f[n+1][0] = 1;
	dwn(i,n,1){
		if(st[i-1] <= m){
			rep(j,max(m-st[i]+1,0),m-st[i-1]){
				if(f[i+1][j]) Add(ans, (1ll * (mul[i-1] + mod) * f[i+1][j] % mod * sa[i-1] + 1ll * g[i+1][j] * (mul[i-1]  + mod)) % mod);//,cout<<"OK"<<i<<" "<<j<<endl;
			}
		}
		rep(j,0,m){
			f[i][j] = f[i+1][j];
			g[i][j] = g[i+1][j];
			if(j >= t[i] && f[i+1][j-t[i]]){
				Add(f[i][j],f[i+1][j-t[i]]);
				Add(g[i][j],(1ll * f[i+1][j-t[i]] * a[i] + g[i+1][j-t[i]]) % mod);
			}
		}
	}
	f[0][0] = 1;
	rep(i,1,n){
		rep(j,m-t[i]+1,m) Add(ans, 1ll * mul[n-i] * g[i-1][j] % mod);
		rep(j,0,m){
			f[i][j] = f[i-1][j];
			g[i][j] = g[i-1][j];
			if(j >= t[i] && f[i-1][j-t[i]]){
				Add(f[i][j],f[i-1][j-t[i]]);
				Add(g[i][j],(1ll * f[i-1][j-t[i]] * a[i] + g[i-1][j-t[i]]) % mod);
			}
		}
	}
	cout << ans;
	return 0;
}