#include<bits/stdc++.h>
#define mod 998244353
#define M 205
using namespace std;
int mul[M], C[M][M], n;
long long k;
void print(vector<int> v)
{
	for(auto t : v) printf("%d ", t);
	puts("");
}
void printl(vector<long long> v)
{
	for(auto t : v) printf("%lld ", t);
	puts("");
}
vector<int> calc(int step, vector<long long> L, vector<long long> R)
{
	vector<int> ans(L.size() + R.size() + 1, 0);
//	cout << step << '\n';
//	printl(L);
//	printl(R);
	if(step == -1 || L.empty() || R.empty())
	{
		for(int i = 0; i <= L.size(); i++) ans[i] = 1ll * C[L.size()][i] * C[R.size()][i] % mod * mul[i] % mod;
//		cout << "BOT: \n";
//		print(ans);
		return ans;
	}
	vector<long long> a, b, c, d;
	for(auto t : L)
	{
//		cout << t << endl;
		if(t & (1ll << step)) a.push_back(t);// cout << 1 << endl;
		else b.push_back(t);// cout << 2 << endl;
	}
	for(auto t : R)
	{
		if(t & (1ll << step)) c.push_back(t);
		else d.push_back(t);
	}
	if(k & (1ll << step))
	{
		vector<int> la = calc(step - 1, a, d), ra = calc(step - 1, b, c);
		for(int i = 0; i < la.size(); i++) for(int j = 0; j < ra.size(); j++) (ans[i + j] += 1ll * la[i] * ra[j] % mod) %= mod;
		return ans;
	}
	else
	{
		vector<int> la = calc(step - 1, a, c), ra = calc(step - 1, b, d);
		for(int i = 0; i < la.size(); i++) for(int j = 0; j < ra.size(); j++) for(int x = 0; x + i <= a.size() && x + j <= d.size(); x++) for(int y = 0; y + i <= c.size() && y + j <= b.size(); y++)
			(ans[i + j + x + y] += 1ll * la[i] * ra[j] % mod * C[a.size() - i][x] % mod * C[d.size() - j][x] % mod * C[c.size() - i][y] % mod * C[b.size() - j][y] % mod * mul[x] % mod * mul[y] % mod) %= mod;
		return ans;
	}
}
int main()
{
	scanf("%d%lld", &n, &k);
	mul[0] = 1;
	for(int i = 1; i < M; i++) mul[i] = 1ll * mul[i - 1] * i % mod;
	C[0][0] = 1;
	for(int i = 1; i < M; i++)
	{
		C[i][0] = 1;
		for(int j = 1; j <= i; j++) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;// cout << i << " " << j << " " << C[i][j] << endl;
	}
	vector<long long> L, R;
	long long x;
	for(int i = 1; i <= n; i++) scanf("%lld", &x), L.push_back(x); 
	for(int i = 1; i <= n; i++) scanf("%lld", &x), R.push_back(x);
	vector<int> ans = calc(60, L, R);
	for(int i = 1; i <= n; i++) printf("%d\n", ans[i]);
	return 0;
}