#include <bits/stdc++.h>
#pragma GCC target "abm,bmi,bmi2"

using namespace std;

constexpr int N = 2e2, T = 3e5 + 1, mod = 998244353;

auto& mul(auto&& a, auto b) { return a = a * (uint64_t)b % mod; }
auto& add(auto&& a, auto b) { return a -= (a += b) >= mod? mod: 0; }

int a[N], t[N], pw2[N];
array<int, 2> dp[T];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, tl, ans{}; cin >> n >> tl;
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int i = 0; i < n; ++i) cin >> t[i];
  fill(&dp[0][0], &dp[T][0], 0);
  dp[0] = {1, 0};
  for (int i = 0, p = 1; i < n; ++i) pw2[i] = p, add(p, p);
  for (int i = 0; i < n; ++i) {
    for (int j = tl - t[i]; ++j <= tl; ) ans = (ans + dp[j][1] * (uint64_t)pw2[n - i - 1]) % mod;
    for (int j = tl - t[i]; ~j; --j) dp[j + t[i]] = {add(+dp[j + t[i]][0], dp[j][0]), (dp[j + t[i]][1] + dp[j][1] + a[i] * (uint64_t)dp[j][0]) % mod};
  }
  fill(&dp[0][0], &dp[T][0], 0);
  dp[0] = {1, 0};
  for (int i = n; i--; ) {
    int pt = accumulate(t, t + i, 0), pa = accumulate(a, a + i, 0);
    for (int j = max(tl - pt - t[i], -1); ++j <= tl - pt; ) ans = (ans + (dp[j][1] + dp[j][0] * (uint64_t)pa) % mod * pw2[i]) % mod;
    for (int j = tl - t[i]; ~j; --j) dp[j + t[i]] = {add(+dp[j + t[i]][0], dp[j][0]), (dp[j + t[i]][1] + dp[j][1] + a[i] * (uint64_t)dp[j][0]) % mod};
  }
  cout << ans << '\n';
}