#include <bits/stdc++.h>
using namespace std;
long long read() {
  int f = 1;
  long long res = 0;
  char ch;
  do {
    ch = getchar();
    if (ch == '-') f = -f;
  } while (ch < '0' || ch > '9');
  do {
    res = res * 10 + ch - '0';
    ch = getchar();
  } while (ch >= '0' && ch <= '9');
  return f == 1 ? res : -res;
}
void fast_io() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
const int N = 200010;
const int M = 3010;
const int mod = 998244353;
const long long INF = 1e18;
int n, m;
int A[N], B[N];
char str[N];
int head[N], to[N * 2], nxt[N * 2], tot;
void addEdge(int u, int v) {
  tot++;
  nxt[tot] = head[u];
  to[tot] = v;
  head[u] = tot;
}
template <class T>
T mmax(T a, T b) {
  return a < b ? b : a;
}
template <class T>
T mmin(T a, T b) {
  return a < b ? a : b;
}
int countOne(long long set) {
  int res = 0;
  while (set) {
    res++;
    set &= set - 1;
  }
  return res;
}
bool contain(long long set, int i) { return (set & (1LL << i)) > 0; }
long long myPow(long long a, int p) {
  if (p == 0) return 1;
  long long res = myPow(a, p / 2);
  res *= res;
  res %= mod;
  if (p % 2 == 1) {
    res *= a;
    res %= mod;
  }
  return res;
}
void addMode(long long &a, long long b) { a = (a + b) % mod; }
long long mul(long long a, long long b) { return a * b % mod; }
template <class T>
void mySwap(T &a, T &b) {
  T tmp = a;
  a = b;
  b = tmp;
}
long long sum[2];
long long inv[M * 2];
long long f[M][M];
long long g[M][M];
int main() {
  fast_io();
  cin >> n >> m;
  for (int i = 0; i < n; i++) cin >> A[i];
  for (int i = 0; i < n; i++) {
    cin >> B[i];
    sum[A[i]] += B[i];
  }
  for (int i = mmax(0LL, m - sum[0] - sum[1]); i <= 2 * m; i++) {
    inv[i] = myPow(sum[0] + sum[1] - m + i, mod - 2);
  }
  for (int i = m; i >= 0; i--) {
    g[i][m - i] = f[i][m - i] = 1;
    for (int j = mmin((long long)m - i - 1, sum[0]); j >= 0; j--) {
      f[i][j] = (f[i + 1][j] * (sum[1] + i + 1) + f[i][j + 1] * (sum[0] - j)) %
                mod * inv[m + i - j] % mod;
      g[i][j] = (g[i + 1][j] * (sum[1] + i) + g[i][j + 1] * (sum[0] - j - 1)) %
                mod * inv[m + i - j] % mod;
    }
  }
  for (int i = 0; i < n; i++) {
    cout << (A[i] ? f[0][0] : g[0][0]) * B[i] % mod << endl;
  }
  return 0;
}
