#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
typedef long long ll;

const int N = 200 + 3;
const int T = 3e5 + 3;
const ll MOD = 998244353;

ll n, total, a[N], t[N];
ll prefix[N][T], dp[N][T];

ll compute_sum(int i){
    ll sum = 0;
    for(int j = 0; j <= total; ++j)
        sum += dp[i][j];
    sum %= MOD;
    return sum;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n >> total;
    for(int i = 1; i <= n; ++i)
        cin >> a[i];
    for(int i = 1; i <= n; ++i)
        cin >> t[i];

    ll ans = 0;
    for(int j = 0; j <= total; ++j)
        dp[n + 1][j] = 0;
    dp[n + 1][0] = 1;
    for(int i = n; i >= 1; --i){
        ll curr = a[i] * compute_sum(i + 1) % MOD;
        ans += curr;
        for(int j = 0; j <= total; ++j){
            dp[i][j] = dp[i + 1][j];
            if(j >= t[i]){
                dp[i][j] += dp[i + 1][j - t[i]];
                dp[i][j] %= MOD;
            }
        }
    }

    for(int j = 0; j <= total; ++j)
        dp[0][j] = 0;
    dp[0][0] = 1;
    for(int i = 1; i <= n; ++i){
        ll curr = a[i] * compute_sum(i - 1) % MOD;
        ans += curr;
        for(int j = 0; j <= total; ++j){
            dp[i][j] = dp[i - 1][j];
            if(j >= t[i]){
                dp[i][j] += dp[i - 1][j - t[i]];
                dp[i][j] %= MOD;
            }
        }
    }

    ans %= MOD;
    cout << ans << "\n";
}