#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

string to_string(string a) { return '"' + a + '"'; }
string to_string(char a) { return "'" + string(1, a) + "'"; }
string to_string(const char* a) { return to_string((string) a); }
string to_string(bool a) { return a ? "true" : "false"; }
template <class T1, class T2>
string to_string(pair<T1, T2> a) {
    return "(" + to_string(a.first) + ", " + to_string(a.second) + ")";
}
template <class T>
string to_string(T a) {
    bool first = true; string res = "{";
    for (const auto& i : a) {
        if (!first) res += ", ";
        first = false;
        res += to_string(i);
    }
    res += "}";
    return res;
}
void debug_out() { cerr << endl; }
template <class T1, class... T2>
void debug_out(T1 a, T2... b) {
    cerr << " " << to_string(a);
    debug_out(b...);
}

#ifdef LOCAL
#define out(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define out(...) 42
#endif

clock_t start_time; void start_timer() { start_time = clock(); }
double get_time() { return (double) (clock() - start_time) / CLOCKS_PER_SEC; }

void Solve();

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
    freopen("../input.txt", "r", stdin);
#endif
    start_timer();
    Solve();
#ifdef LOCAL
    cerr << fixed << setprecision(3);
    cerr << endl << "Time spent: " << get_time() << endl;
#endif
    return 0;
}

template <int m>
struct mint {
    int x = 0;
    mint(int a = 0) : x(a) {}
    friend istream& operator>>(istream& is, mint& a) { return is >> a.x; }
    friend ostream& operator<<(ostream& os, mint& a) { return os << a.x; }
    friend mint binpow(mint a, ll b) {
        mint res = 1;
        while (b) {
            if (b & 1) res *= a;
            a *= a;
            b >>= 1;
        }
        return res;
    }
    mint pow(ll a) const { return binpow(*this, a); }
    mint inv() const { return pow(m - 2); }
    mint operator-() const { return x ? m - x : 0; }
    mint& operator+=(const mint& a) { x += a.x; if (x >= m) x -= m; return *this; }
    mint& operator-=(const mint& a) { x -= a.x; if (x < 0) x += m; return *this; }
    mint& operator*=(const mint& a) { x = x * 1ll * a.x % m; return *this; }
    mint& operator/=(const mint& a) { return *this *= a.inv(); }
    friend mint operator+(mint a, const mint& b) { return a += b; }
    friend mint operator-(mint a, const mint& b) { return a -= b; }
    friend mint operator*(mint a, const mint& b) { return a *= b; }
    friend mint operator/(mint a, const mint& b) { return a /= b; }
    bool operator==(const mint& a) const { return x == a.x; }
    bool operator!=(const mint& a) const { return x != a.x; }
};

const int mod = 998244353;

#define mi mint<mod>

const int N = 205;
const int K = 3e5 + 5;

int a[N];
int t[N];
int pref_t[N];
mi dp[K];

void Solve() {
    int n, T;
    cin >> n >> T;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
        cin >> t[i];
        pref_t[i] = min(K, pref_t[i - 1] + t[i]);
    }
    mi ans = 0;
    dp[0] = 1;
    for (int i = 1; i <= n; i++) {
        mi pref = 0;
        for (int j = 0; j <= T - t[i]; j++) {
            pref += dp[j];
        }
        ans += mi(a[i]) * pref * mi(2).pow(n - i);
        for (int j = K - t[i]; j >= 0; j--) {
            dp[j + t[i]] += dp[j];
        }
    }
    for (int i = 0; i < K; i++) {
        dp[i] = 0;
    }
    dp[0] = 1;
    for (int i = n; i >= 1; i--) {
        mi suf = 0;
        for (int j = 0; j <= T - pref_t[i]; j++) {
            suf += dp[j];
        }
        ans += mi(a[i]) * suf * mi(2).pow(i - 1);
        for (int j = K - t[i]; j >= 0; j--) {
            dp[j + t[i]] += dp[j];
        }
    }
    cout << ans << "\n";
}