#include <cstdio>
const int N = 205, M = 2e5 + 5, P = 998244353;
int n, T, a[N], t[N], p[N], pow[N];
int dp1[M], dp2[N], st[N], ans;
int main() {
    scanf("%d%d", &n, &T);
    for (int i = 1; i <= n; i++) scanf("%d", a + i);
    for (int i = 1; i <= n; i++) scanf("%d", t + i), st[i] = st[i - 1] + t[i];
    pow[0] = 1;
    for (int i = 1; i <= n; i++) pow[i] = (pow[i - 1] * 2ll) % P;
    dp1[0] = dp2[0] = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= T - t[i]; j++) {
            p[i] += 1ll * dp1[j] * pow[n - i] % P;
            // printf("dp1[%d] = %d\n", j, dp1[j]);
            // printf("p[%d] += %d * %d = %lld\n", i, dp1[j], pow[n - i], 1ll * dp1[j] * pow[n - i] % P);
        }

        for (int j = T; j >= t[i]; j--)
            dp1[j] += dp1[j - t[i]];

        // printf("%d%c", p[i], " \n"[i == n]);
    }
    for (int i = n; i >= 1; i--) {
        for (int j = 0; j <= T - st[i]; j++)
            p[i] += 1ll * dp2[j] * pow[i - 1] % P;
        for (int j = T; j >= t[i]; j--)
            dp2[j] += dp2[j - t[i]];
    }
    for (int i = 1; i <= n; i++) ans = (ans + 1ll * p[i] * a[i] % P) % P;
    printf("%d\n", ans);
}