#include<bits/stdc++.h>
#define LL long long
#define rep(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define drep(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define erep(i,a) for(int i=head[a];i;i=e[i].nxt)
using namespace std;
const int N=205,M=1e6+5,P=998244353;
int MOD(int x){
    if(x>=P)x-=P;
    if(x<0)x+=P;
    return x;
}
void ADD(int &x,int y){
    x=MOD(x+y);
}
int n;
LL k,a[N],b[N];
int son[M][2],tot,sz[M],rt1,rt2;
int s[M],ks[M];
void add(LL x,int p){
    rep(i,0,59){
        s[i]=x&1;
        x>>=1;
    }
    drep(i,59,0){
        if(!son[p][s[i]])son[p][s[i]]=++tot;
        ++sz[p=son[p][s[i]]];
    }
}
int C[N][N],A[N][N];
int f[M][N];
int tmp[N];
void dfs(int p,int q,int t){
    if(!p || !q){
        f[p][0]=1;
        return;
    }
    // printf("dfs %d %d %d\n",p,q,t);
    if(t<0){
        rep(i,0,min(sz[p],sz[q]))f[p][i]=1ll*C[sz[p]][i]*A[sz[q]][i]%P;
        return;
    }
    if(ks[t]==1){
        dfs(son[p][0],son[q][1],t-1);
        dfs(son[p][1],son[q][0],t-1);
        rep(i,0,min(sz[son[p][0]],sz[son[q][1]]))if(f[son[p][0]][i])
            rep(j,0,min(sz[son[p][1]],sz[son[q][0]]))if(f[son[p][1]][j])
                ADD(f[p][i+j],1ll*f[son[p][0]][i]*f[son[p][1]][j]%P);
        return;
    }
    dfs(son[p][0],son[q][0],t-1);
    dfs(son[p][1],son[q][1],t-1);
    rep(i,0,min(sz[son[p][0]],sz[son[q][0]]))if(f[son[p][0]][i])
        rep(j,0,min(sz[son[p][1]],sz[son[q][1]]))if(f[son[p][1]][j]){
            int sp0=sz[son[p][0]]-i;
            int sq0=sz[son[q][0]]-i;
            int sp1=sz[son[p][1]]-j;
            int sq1=sz[son[q][1]]-j;
            int s=min(sp0,sq1)+min(sp1,sq0);
            rep(k,0,s)tmp[k]=0;
            rep(u,0,min(sp0,sq1))rep(v,0,min(sp1,sq0))
                ADD(tmp[u+v],1ll*C[sp0][u]*A[sq1][u]%P*C[sp1][v]%P*A[sq0][v]%P);
            rep(k,0,s)ADD(f[p][i+j+k],1ll*f[son[p][0]][i]*f[son[p][1]][j]%P*tmp[k]%P);
        }
}
void init(){
    rep(i,C[0][0]=1,n)rep(j,C[i][0]=1,i)
        C[i][j]=MOD(C[i-1][j-1]+C[i-1][j]);
    rep(i,A[0][0]=1,n)rep(j,A[i][0]=1,i)
        A[i][j]=1ll*A[i][j-1]*(i-j+1)%P;
}
int main(){
    scanf("%d%lld",&n,&k);
    LL x=k;
    rep(i,0,59){
        ks[i]=x&1;
        x>>=1;
    }
    rep(i,1,n)scanf("%lld",&a[i]);
    rep(i,1,n)scanf("%lld",&b[i]);
    rt1=++tot;
    rep(i,1,n)add(a[i],rt1);
    rt2=++tot;
    rep(i,1,n)add(b[i],rt2);

    init();
    dfs(rt1,rt2,59);
    rep(i,1,n)printf("%d\n",f[rt1][i]);
    return 0;
}
/*
9 5
1 7 2 8 4 9 2 5 10
1 3 2 4 5 8 8 8 9

51
1034
10768
62195
200965
348924
294444
97344
7200
*/