#include<bits/stdc++.h>
#define MAXN 210
#define MOD 998244353
#define LL long long
using namespace std;
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rof(i,a,b) for(int i=(a);i>=(b);i--)
LL a[MAXN],t[MAXN],sa[MAXN],st[MAXN];
LL dp[300010],num[300010],dp2[300010],num2[300010];
int n,T;
LL mi(LL x,LL y){
    LL ans=1;
    while (y){
        if (y&1) ans=1LL*ans*x%MOD;
        x=x*x%MOD;
        y>>=1;
    }
    return ans;
}
int main(){
    std::ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    cin>>n>>T;
    For(i,1,n) {cin>>a[i];sa[i]=sa[i-1]+a[i];}
    For(i,1,n) {cin>>t[i];st[i]=st[i-1]+t[i];}
    if (st[n]<=T){
        cout<<mi(2,n)*sa[n]%MOD;
        return 0;
    }
    LL ans=0;
    num[0]=1;
    Rof(i,n,1){
        if (st[i-1]<=T){
            LL now=0;
            For(j,T-st[i]+1,T-st[i-1]){
                if (j<0) continue;
                now=(now+dp[j])%MOD;
            }
            ans=(ans+(now+sa[i-1])*(mi(2,i-1)+MOD-1))%MOD;
            // printf("i=%d ans=%d\n",i,ans);
        }
        Rof(j,T,0){
            if (j-t[i]<0) break;
            dp[j]=(dp[j]+dp[j-t[i]]+a[i]*num[j-t[i]])%MOD;
            num[j]=(num[j]+num[j-t[i]])%MOD;
        }
        // printf("i=%d\n",i);
        // For(j,0,T) printf("dp[%d]=%d num[%d]=%d\n",j,dp[j],j,num[j]);
    }
    memset(dp,0,sizeof(dp));
    memset(num,0,sizeof(num));
    num[0]=1;
    For(i,1,n){
        For(j,T-t[i]+1,T){
            if (j<0) continue;
            ans=(ans+dp[j]*mi(2,n-i))%MOD;
        }
        if (T-t[i]>=0) ans=(ans+dp[T-t[i]]+a[i]*num[T-t[i]])%MOD;
        // printf("i=%d ans=%d\n",i,ans);
        Rof(j,T,0){
            if (j-t[i]<0) break;
            dp[j]=(dp[j]+dp[j-t[i]]+a[i]*num[j-t[i]])%MOD;
            num[j]=(num[j]+num[j-t[i]])%MOD;
        }
    }
    cout<<ans;
}
/*
3 3
2 3 4
1 2 2
*/