#include <bits/stdc++.h>
#include <iostream>
using namespace std;

#define int long long

const int N = 205, mod = 998244353;
int n, k, C[N][N];

signed main(){
  ios::sync_with_stdio(0);
  cin >> n >> k;
  vector<int> a(n), b(n), fac(n + 1);
  fac[0] = 1;
  for (int i = 1; i <= n; i++){
    fac[i] = fac[i - 1] * i % mod;
  } 
  for (int i = 0; i < n; i++){
    cin >> a[i];
  }
  for (int i = 0; i < n; i++){
    cin >> b[i];
  }
  for (int i = 0; i <= n; i++){
    C[i][0] = 1;
    for (int j = 1; j <= i; j++){
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
    }
  }
  function<vector<int>(vector<int>&, vector<int>&, int)> solve 
  = [&](auto &a, auto &b, int p) -> vector<int> {
    if (a.empty() || b.empty()){
      return {1};
    }
    if (p < 0) {
      vector<int> res(min(a.size(), b.size()) + 1);
      for (int i = 0; i < res.size(); i++){
        res[i] = C[a.size()][i] * C[b.size()][i] % mod * fac[i] % mod;
      }
      return res;
    }
    vector<int> a0, a1, b0, b1;
    for (int x : a){
      if (x >> p & 1){
        a1.push_back(x);
      } else {
        a0.push_back(x);
      }
    }
    for (int x : b){
      if (x >> p & 1){
        b1.push_back(x);
      } else {
        b0.push_back(x);
      }
    }
    auto combine = [&](auto &x, auto &y) -> vector<int> {
      vector<int> res(x.size() + y.size() + 1);
      for (int i = 0; i < x.size(); i++){
        for (int j = 0; j < y.size(); j++){
          res[i + j] = (res[i + j] + x[i] * y[j]) % mod;
        }
      }
      while (res.back() == 0) res.pop_back();
      return res;
    };
    if (k >> p & 1){
      auto x = solve(a1, b0, p - 1), y = solve(a0, b1, p - 1);
      return combine(x, y);
    } else {
      auto A = solve(a0, b0, p - 1), B = solve(a1, b1, p - 1);
      vector<int> res(min(a.size(), b.size()) + 1);
      for (int i = 0; i < A.size(); i++){
        for (int j = 0; j < B.size(); j++){
          int restx = min(a0.size() - i, b1.size() - j), resty = min(b0.size() - i, a1.size() - j);
          for (int x = 0; x <= restx; x++) for (int y = 0; y <= resty; y++){
            res[i + j + x + y] = (res[i + j + x + y] + A[i] * B[j] % mod 
                            * C[a0.size() - i][x] % mod * C[b1.size() - j][x] % mod * fac[x] % mod
                            * C[b0.size() - i][y] % mod * C[a1.size() - j][y] % mod * fac[y]) % mod;
          }
        }
      }
      while (res.back() == 0) res.pop_back();
      return res;
    }
  };
  auto ans = solve(a, b, 60);
  while (ans.size() <= n) ans.push_back(0);
  for (int i = 1; i < ans.size(); i++){
    cout << ans[i] << endl;
  }
}