#include <bits/stdc++.h>

using namespace std;

#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

using vi = vector <int>;

const int P = 998244353;

const int N = 18;
const int M = 1 << N;
const int L = 80;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

int inc(int a, int b) { return (a += b) >= P ? a - P : a; }
int dec(int a, int b) { return (a -= b) < 0 ? a + P : a; }
int mul(int a, int b) { return 1ll * a * b % P; }
void add(int &a, int b) { (a += b) >= P ? a -= P : 1; }
void sub(int &a, int b) { (a -= b) < 0 ? a += P : 1; }
int sgn(int x) { return x & 1 ? P - 1 : 1; }
int qpow(int a, int b) { int res = 1; for (; b; b >>= 1, a = mul(a, a)) if (b & 1) res = mul(res, a); return res; }

void fwt_or(int *f, int n, int o) {
  for (int k = 1; k < n; k <<= 1) {
    for (int i = 0; i < n; i += k << 1) {
      for (int j = 0; j < k; ++ j) {
        if (~o) add(f[i + j + k], f[i + j]);
        else sub(f[i + j + k], f[i + j]);
      }
    }
  }
}

void fwt_and(int *f, int n, int o) {
  for (int k = 1; k < n; k <<= 1) {
    for (int i = 0; i < n; i += k << 1) {
      for (int j = 0; j < k; ++ j) {
        if (~o) add(f[i + j], f[i + j + k]);
        else sub(f[i + j], f[i + j + k]);
      }
    }
  }
}

vi berlekamp_massey(vi a) {
  int n = a.size(), cnt = 0;
  // pa(a, 0, n - 1);
  vi delta(n), fail(n + 1);
  vector <vi> R(n + 1);
  for (int i = 0, t, p = 0; i < n; ++ i) {
    delta[i] = a[i];
    for (int j = 0; j < R[cnt].size(); ++ j) sub(delta[i], mul(R[cnt][j], a[i - j - 1]));
    if (!delta[i]) continue;
    fail[cnt] = i, ++ cnt;
    if (cnt == 1) { R[cnt].resize(i + 1); continue; }
    t = mul(delta[i], qpow(delta[fail[p]], P - 2));
    vi r0(i - fail[p] - 1, 0);
    r0.push_back(t);
    for (auto it : R[p]) r0.push_back(mul(it, P - t));
    R[cnt].resize(max(R[cnt - 1].size(), r0.size()));
    for (int j = 0; j < R[cnt - 1].size(); ++ j) add(R[cnt][j], R[cnt - 1][j]);
    for (int j = 0; j < r0.size(); ++ j) add(R[cnt][j], r0[j]);
    if ((int) R[cnt - 1].size() - fail[cnt - 1] < (int) R[p].size() - fail[p]) p = cnt - 1;
  }
  return R[cnt];
}

vi reduce(vi a) {
  while (a.size() && !a.back()) a.pop_back();
  return a;
}

vi operator + (vi a, vi b) {
  int n = a.size(), m = b.size();
  vi res(max(n, m));
  rep(i, 0, n - 1) add(res[i], a[i]);
  rep(i, 0, m - 1) add(res[i], b[i]);
  return res;
}

vi operator - (vi a, vi b) {
  int n = a.size(), m = b.size();
  vi res(max(n, m));
  rep(i, 0, n - 1) add(res[i], a[i]);
  rep(i, 0, m - 1) sub(res[i], b[i]);
  return res;
}

vi operator * (vi a, vi b) {
  int n = a.size(), m = b.size();
  vi res(n + m - 1);
  rep(i, 0, n - 1) rep(j, 0, m - 1) {
    add(res[i + j], mul(a[i], b[j]));
  }
  return res;
}

vi operator / (vi a, vi b) {
  int n = a.size(), m = b.size();
  if (n < m) return {};
  vi res(n - m + 1);
  drep(i, n - m, 0) {
    res[i] = mul(a[i + m - 1], qpow(b[m - 1], P - 2));
    rep(j, 0, m - 1) sub(a[i + j], mul(res[i], b[j]));
  }
  return res;
}

vi operator % (vi a, vi b) {
  return reduce(a - a / b * b);
}

vi work(vi coef, int b) {
  int n = coef.size();
  vi g(n + 1), res{1}, a{0, 1};
  g[n] = 1;
  rep(i, 0, n - 1) g[i] = dec(0, coef[n - 1 - i]);
  for (; b; b >>= 1, a = a * a % g) {
    if (b & 1) res = res * a % g;
  }
  return res;
}

int n, p, k, x, c[M], ipw[N], f[L][M], g[L][M], tf[M], tg[M], ans[M];

int main() {
  n = read(), p = read(), k = read(), x = read();
  for (int s = 0; s < 1 << n; ++ s) c[s] = read();
  rep(i, 0, n) ipw[i] = qpow(1 << i, P - 2);
  f[0][x] = 1;
  rep(i, 1, L - 1) {
    fwt_or(f[i - 1], 1 << n, 1);
    fwt_or(g[i - 1], 1 << n, 1);
    for (int s = 0; s < 1 << n; ++ s) {
      int t = ipw[n - __builtin_popcount(s)];
      tf[s] = mul(f[i - 1][s], t);
      tg[s] = mul(g[i - 1][s], t);
    }
    fwt_or(f[i - 1], 1 << n, -1);
    fwt_or(g[i - 1], 1 << n, -1);
    fwt_or(tf, 1 << n, -1);
    fwt_or(tg, 1 << n, -1);
    for (int s = 0; s < 1 << n; ++ s) {
      add(f[i][s], mul(tf[s], p));
      add(g[i][s], mul(tg[s], p));
    }
    fwt_and(f[i - 1], 1 << n, 1);
    fwt_and(g[i - 1], 1 << n, 1);
    for (int s = 0; s < 1 << n; ++ s) {
      int t = ipw[__builtin_popcount(s)];
      tf[s] = mul(f[i - 1][s], t);
      tg[s] = mul(g[i - 1][s], t);
    }
    fwt_and(f[i - 1], 1 << n, -1);
    fwt_and(g[i - 1], 1 << n, -1);
    fwt_and(tf, 1 << n, -1);
    fwt_and(tg, 1 << n, -1);
    for (int s = 0; s < 1 << n; ++ s) {
      add(f[i][s], mul(tf[s], dec(1, p)));
      add(g[i][s], mul(tg[s], dec(1, p)));
    }
    for (int s = 0; s < 1 << n; ++ s) {
      add(g[i][s], mul(f[i][s], c[s]));
    }
  }
  if (k < L) {
    for (int s = 0; s < 1 << n; ++ s) {
      printf("%d%c", g[k][s], " \n"[s + 1 == (1 << n)]);
    }
    return 0;
  }
  vi val(L);
  rep(i, 0, L - 1) val[i] = g[i][0];
  vi coef = berlekamp_massey(val);
  vi res = work(coef, k);
  for (int s = 0; s < 1 << n; ++ s) {
    for (int i = 0; i < res.size(); ++ i) {
      add(ans[s], mul(g[i][s], res[i]));
    }
    printf("%d%c", ans[s], " \n"[s + 1 == (1 << n)]);
  }
  return 0;
}