#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
inline int Mod(int x) { return x + ((x >> 31) & mod); }
inline int add(int x, int y) { return Mod(x + y - mod); }
inline int sub(int x, int y) { return Mod(x - y); }
inline int mul(int x, int y) { return 1ll * x * y % mod; }
int qpow(int a, int b) {
	if (!b) return 1;
	int t = qpow(a, b >> 1);
	t = mul(t, t);
	if (b & 1) return mul(t, a);
	return t;
}
const int maxn = 17, maxl = 36;
int n, p, pp, K, x0;
int c[1 << maxn];
int f[2 * maxl + 5][1 << maxn], g[2 * maxl + 5][1 << maxn];
void fwtOr(int v[], int len, bool tp) {
	for (int i = 1; i < len; i <<= 1)
		for (int j = 0; j < len; j += i << 1)
			for (int k = 0; k < i; k++) {
				if (tp) v[i + j + k] = sub(v[i + j + k], v[j + k]);
				else v[i + j + k] = add(v[i + j + k], v[j + k]);
			}
}
void fwtAnd(int v[], int len, bool tp) {
	for (int i = 1; i < len; i <<= 1)
		for (int j = 0; j < len; j += i << 1)
			for (int k = 0; k < i; k++) {
				if (tp) v[j + k] = sub(v[j + k], v[i + j + k]);
				else v[j + k] = add(v[j + k], v[i + j + k]);
			}
}
int tra[1 << maxn], tro[1 << maxn];
int t1[1 << maxn], t2[1 << maxn];
void tr(const int fr[], int to[], int len) {
	memcpy(t1, fr, sizeof(t1));
	fwtOr(t1, len, 0);
	for (int s = 0; s < len; s++) to[s] = mul(mul(t1[s], tro[s]), p);
	fwtOr(to, len, 1);
	memcpy(t1, fr, sizeof(t1));
	fwtAnd(t1, len, 0);
	for (int s = 0; s < len; s++) t2[s] = mul(mul(t1[s], tra[s]), pp);
	fwtAnd(t2, len, 1);
	for (int s = 0; s < len; s++) to[s] = add(to[s], t2[s]);
}
int dt[2 * maxl + 5];
int fl[2 * maxl + 5];
int r[2 * maxl + 5][maxl + 5];
int siz[2 * maxl + 5];
int rc;
void BM(int len) {
	int s = 0;
	for (int i = 1; i <= len; i++) {
		dt[i] = f[i][0];
		for (int j = 1; j <= siz[rc]; j++) dt[i] = sub(dt[i], mul(r[rc][j], f[i - j][0]));
		if (!dt[i]) continue;
		fl[rc] = i;
		if (!rc) { siz[++rc] = i; continue; }
		int t = mul(dt[i], qpow(dt[fl[s]], mod - 2));
		siz[++rc] = i - fl[s] - 1;
		r[rc][++siz[rc]] = t;
		for (int j = 1; j <= siz[s]; j++) r[rc][++siz[rc]] = Mod(-mul(r[s][j], t));
		if (siz[rc] > siz[rc - 1]) s = rc - 1;
		else siz[rc] = siz[rc - 1];
		for (int j = 1; j <= siz[rc - 1]; j++) r[rc][j] = add(r[rc][j], r[rc - 1][j]);
	}
}
int rl;
struct matrix {
	int v[maxl + 5][maxl + 5];
	matrix() { memset(v, 0, sizeof(v)); }
	matrix operator*(const matrix& b) const {
		matrix rs;
		for (int i = 1; i <= rl; i++)
			for (int k = 1; k <= rl; k++)
				for (int j = 1; j <= rl; j++) rs.v[i][j] = add(rs.v[i][j], mul(v[i][k], b.v[k][j]));
		return rs;
	}
};
matrix qpow(const matrix& a, int b) {
	if (b == 1) return a;
	matrix t = qpow(a, b >> 1);
	t = t * t;
	if (b & 1) return t * a;
	return t;
}
int main() {
	scanf("%d%d%d%d", &n, &p, &K, &x0), pp = sub(1, p);
	int S = 1 << n;
	int inv = qpow(S, mod - 2);
	for (int s = 0; s < S; s++) {
		scanf("%d", &c[s]);
		tra[s] = tro[s] = inv;
	}
	fwtAnd(tra, S, 0), fwtOr(tro, S, 0);
	g[0][x0] = 1;
	rl = 2 * n + 2;
	for (int i = 1; i <= min(K, 2 * rl); i++) {
		tr(g[i - 1], g[i], S);
		tr(f[i - 1], f[i], S);
		for (int s = 0; s < S; s++) f[i][s] = add(f[i][s], mul(g[i][s], c[s]));
	}
	if (K <= 2 * rl) {
		for (int s = 0; s < S; s++) printf("%d ", f[K][s]);
	} else {
		BM(2 * rl);
		matrix M;
		for (int i = 1; i <= rl; i++) {
			M.v[i][1] = r[rc][i];
			if (i < rl) M.v[i][i + 1] = 1;
		}
		M = qpow(M, K - 2 * rl);
		for (int s = 0; s < S; s++) {
			int ans = 0;
			for (int i = 1; i <= rl; i++) ans = add(ans, mul(f[2 * rl + 1 - i][s], M.v[i][1]));
			printf("%d ", ans);
		}
	}
}