#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int M=205,P=998244353;
int n;
ll k;
int C[M][M],Pow[M];
vector<int> Solve(vector<ll>a,vector<ll>b,int d){
	int tot=min(a.size(),b.size());
	vector<int>res(tot+1);
	if(a.empty()||b.empty()){
		res[0]=1;
		return res;
	}
	if(d<0){
		for(int i=0;i<=tot;i++){
			res[i]=C[a.size()][i]*1ll*C[b.size()][i]%P*Pow[i]%P;
		}
		return res;
	}
	vector<ll>A[2],B[2];
	for(int i=0;i<a.size();i++)A[(a[i]>>d)&1].push_back(a[i]);
	for(int i=0;i<b.size();i++)B[(b[i]>>d)&1].push_back(b[i]);
	if((k>>d)&1){
		vector<int>p=Solve(A[0],B[1],d-1);
		vector<int>q=Solve(A[1],B[0],d-1);
		for(int i=0;i<p.size();i++){
			for(int j=0;j<q.size();j++){
				res[i+j]=(p[i]*1ll*q[j]+res[i+j])%P;
			}
		}
	}else{
		vector<int>p=Solve(A[0],B[0],d-1);
		vector<int>q=Solve(A[1],B[1],d-1);
		for(int i=0;i<p.size();i++){
			for(int j=0;j<q.size();j++){
				int a0=A[0].size()-i,b0=B[0].size()-i;
				int a1=A[1].size()-j,b1=B[1].size()-j;
				for(int u=0;u<=min(a0,b1);u++){
					for(int v=0;v<=min(a1,b0);v++){
						res[i+j+u+v]=(res[i+j+u+v]+p[i]*1ll*q[j]%P*
						C[a0][u]%P*C[b1][u]%P*Pow[u]%P*
						C[a1][v]%P*C[b0][v]%P*Pow[v]%P)%P;
					}
				}
			}
		}
	}
	return res;
}
int main(){
	scanf("%d%lld",&n,&k);
	vector<ll>A(n),B(n);
	for(int i=0;i<n;i++)scanf("%lld",&A[i]);
	for(int i=0;i<n;i++)scanf("%lld",&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-1]+C[i-1][j])%P;
		}
	}
	Pow[0]=1;
	for(int i=1;i<=n;i++)Pow[i]=Pow[i-1]*1ll*i%P;
	vector<int>ans;
	ans=Solve(A,B,59);
	for(int i=1;i<=n;i++)printf("%d\n",ans[i]);
}