#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double
#define li __int128

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<int D, typename T>struct vec : public vector<vec<D - 1, T>> {template<typename... Args>vec(int n = 0, Args... args) : vector<vec<D - 1, T>>(n, vec<D - 1, T>(args...)) {}};
template<typename T>struct vec<1, T> : public vector<T> {vec(int n = 0, T val = T()) : vector<T>(n, val) {}};
template<class T1,class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const deque<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
int ri(){int x;scanf("%i",&x);return x;}
void rd(int&x){scanf("%i",&x);}
void rd(long long&x){scanf("%lld",&x);}
void rd(double&x){scanf("%lf",&x);}
void rd(long double&x){scanf("%Lf",&x);}
void rd(string&x){cin>>x;}
void rd(char*x){scanf("%s",x);}
template<typename T1,typename T2>void rd(pair<T1,T2>&x){rd(x.first);rd(x.second);}
template<typename T>void rd(vector<T>&x){for(T&p:x)rd(p);}
template<typename C,typename...T>void rd(C&a,T&...args){rd(a);rd(args...);}
//istream& operator>>(istream& is,__int128& a){string s;is>>s;a=0;int i=0;bool neg=false;if(s[0]=='-')neg=true,i++;for(;i<s.size();i++)a=a*10+s[i]-'0';if(neg)a*=-1;return is;}
//ostream& operator<<(ostream& os,__int128 a){bool neg=false;if(a<0)neg=true,a*=-1;ll high=(a/(__int128)1e18);ll low=(a-(__int128)1e18*high);string res;if(neg)res+='-';if(high>0){res+=to_string(high);string temp=to_string(low);res+=string(18-temp.size(),'0');res+=temp;}else res+=to_string(low);os<<res;return os;}
const int mod=998244353;
int add(int a,int b){
    a+=b;
    if(a>=mod)
        a-=mod;
    return a;
}
int sub(int a,int b){
    a-=b;
    if(a<0)
        a+=mod;
    return a;
}
int mul(int a,int b){
    return (long long)a*b%mod;
}
const int N=201,T=3e5+5;
int ways[N][T],a[N],t[N],tmax;
int ways2[N][T];
int n;
int calc(int i,int tt){
	if(i<0){
		if(tt==0)
		return 1;
		else return 0;
	}
	if(ways[i][tt]!=-1)return ways[i][tt];
	ways[i][tt]=calc(i-1,tt);
	if(t[i]<=tt){
		ways[i][tt]=add(ways[i][tt],calc(i-1,tt-t[i]));
	}
	return ways[i][tt];
}
int calc2(int i,int tt){
	if(i==n){
		if(tt==0)
		return 1;
		else return 0;
	}
	if(ways2[i][tt]!=-1)return ways2[i][tt];
	ways2[i][tt]=calc2(i+1,tt);
	if(t[i]<=tt){
		ways2[i][tt]=add(ways2[i][tt],calc2(i+1,tt-t[i]));
	}
	return ways2[i][tt];
}
int main()
{
	memset(ways,-1,sizeof ways);
	memset(ways2,-1,sizeof ways2);
	n=ri();
	tmax=ri();
	for(int i=0;i<n;i++){
		a[i]=ri();
	}
	for(int i=0;i<n;i++){
		t[i]=ri();
	}
	vector<int> pw(n);
	pw[0]=1;
	for(int i=1;i<n;i++){
		pw[i]=add(pw[i-1],pw[i-1]);
	}
	int ans=0;
	int sm=0;
	for(int i=0;i<n;i++){
		// Counted as active
		for(int tt=0;tt<=tmax-t[i];tt++){
			//printf("%i: %i active: %i\n",i,tt,calc(i-1,tt));
			ans=add(ans,mul(pw[n-i-1],mul(a[i],calc(i-1,tt))));
		}
		// Counted as active
		sm+=t[i];
		for(int tt=0;tt<=tmax-sm;tt++){
			//printf("%i: %i inactive: %i\n",i,tt,calc2(i+1,tt));
			ans=add(ans,mul(pw[i],mul(a[i],calc2(i+1,tt))));
		}
	}
	printf("%i\n",ans);
	return 0;
}