#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 205;
ll n, k, C[N][N], fac[N];
vector<ll> solve(vector<ll> a, vector<ll> b, ll d){
    int siz = min(a.size(), b.size());
    vector<ll> res(siz + 1, 0);
    if(!siz){res[0] = 1; return res;};
    if(d == -1){
        int x = a.size(), y = b.size();
        _rep(i, 0, siz) res[i] = C[x][i] * C[y][i] % mod * fac[i] % mod;
        return res;
    }
    vector<ll> A[2], B[2];
    for(auto &i : a) A[i >> d & 1ll].pb(i);
    for(auto &i : b) B[i >> d & 1ll].pb(i);
    if(k >> d & 1ll){
        vector<ll> L = solve(A[0], B[1], d - 1), R = solve(A[1], B[0], d - 1);
        _rep(i, 0, min(A[0].size(), B[1].size())) _rep(j, 0, min(A[1].size(), B[0].size())){
            add(res[i + j], L[i] * R[j]);
        }
    }else{
        vector<ll> L = solve(A[0], B[0], d - 1), R = solve(A[1], B[1], d - 1);
        _rep(i, 0, min(A[0].size(), B[0].size())) _rep(j, 0, min(A[1].size(), B[1].size())){
            int x[2] = {(int)A[0].size() - i, (int)A[1].size() - j}, y[2] = {(int)B[0].size() - i, (int)B[1].size() - j};
            _rep(p, 0, min(x[0], y[1])) _rep(q, 0, min(x[1], y[0])){
                ll cur = C[x[0]][p] * C[y[1]][p] % mod * C[x[1]][q] % mod * C[y[0]][q] % mod;
                mul(cur, fac[p] * fac[q] % mod);
                add(res[i + j + p + q], L[i] * R[j] % mod * cur % mod);
            }
        }
    }
    // debug("d:%d\n", d);
    // for(auto &i : a) debug("%d ", i); debug("\n");
    // for(auto &i : b) debug("%d ", i); debug("\n");
    // _rep(i, 0, siz) debug("%d ", res[i]);
    // debug("\n");
    // debug("==============\n");
    return res;
}
int main(){
    read(n, k);
    _rep(i, 0, n) _rep(j, 0, i) C[i][j] = !j ? 1 : pls(C[i - 1][j], C[i - 1][j - 1]);
    fac[0] = 1; _rep(i, 1, n) fac[i] = fac[i - 1] * i % mod;
    vector<ll> a(n, 0), b(n, 0);
    _rep(i, 1, n) read(a[i - 1]);
    _rep(i, 1, n) read(b[i - 1]);
    vector<ll> res = solve(a, b, 59);
    _rep(i, 1, n) writeln(res[i]);
    return 0;
}