#include <bits/stdc++.h>
using namespace std;
const int MOD = 119 << 23 | 1;
const int FFTMOD = 119 << 23 | 1;
const int INF = (int)1e9 + 23111992;
const long long LINF = (long long)1e18 + 23111992;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline unsigned long long isqrt(unsigned long long k) {
  unsigned long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int mrand() { return abs((int)mt()); }
void solve() {
  int n, m;
  cin >> n >> m;
  vector<int> a(n);
  for (int i = (0); i < (n); ++i) cin >> a[i];
  vector<int> w(n);
  for (int i = (0); i < (n); ++i) cin >> w[i];
  int x = 0, y = 0;
  for (int i = (0); i < (n); ++i) {
    if (a[i]) {
      x += w[i];
    } else {
      y += w[i];
    }
  }
  vector<int> f(m + m + 1);
  for (int i = (0); i < (m + m + 1); ++i) {
    f[i] = inv(x + y + i - m + MOD);
  }
  vector<vector<int> > dp(m + 1, vector<int>(m + m + 1));
  dp[0][m] = 1;
  for (int i = (0); i < (m); ++i) {
    for (int j = (0); j < (m + m + 1); ++j)
      if (dp[i][j]) {
        int dif = j - m;
        int sum = i;
        if ((dif + sum) % 2 == 0) {
          int p = (sum + dif) / 2;
          int q = (sum - dif) / 2;
          if (0 <= p && 0 <= q) {
            int xx = x + p;
            int yy = y - q;
            if (0 <= xx && 0 <= yy && 0 < xx + yy) {
              int coef = f[j];
              if (j + 1 < m + m + 1) {
                addmod(dp[i + 1][j + 1], mult(dp[i][j], mult(xx, coef)));
              }
              if (j) {
                addmod(dp[i + 1][j - 1], mult(dp[i][j], mult(yy, coef)));
              }
            }
          }
        }
      }
  }
  int uu = 0, vv = 0;
  for (int j = (0); j < (m + m + 1); ++j)
    if (dp[m][j]) {
      int dif = j - m;
      int sum = m;
      if ((dif + sum) % 2 == 0) {
        int p = (sum + dif) / 2;
        int q = (sum - dif) / 2;
        if (0 <= p && 0 <= q) {
          addmod(uu, mult(dp[m][j], 1 + mult(p, inv(x))));
          addmod(vv, mult(dp[m][j], 1 + MOD - mult(q, inv(y))));
        }
      }
    }
  for (int i = (0); i < (n); ++i) {
    if (a[i]) {
      cout << mult(w[i], uu) << " \n"[i == n - 1];
    } else {
      cout << mult(w[i], vv) << " \n"[i == n - 1];
    }
  }
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  if (argc > 1) {
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    assert(freopen(argv[2], "wb", stdout));
  }
  solve();
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
