#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 10, mod = 998244353;
int n, r[N], l, tt, w[N], A[N], B[N], f[N], g[N], jc[N], inv[N];
long long m;
int ksm(int x, int k) {
  int s = 1;
  for (; k; k >>= 1, x = 1ll * x * x % mod)
    if (k & 1) s = 1ll * s * x % mod;
  return s;
}
void NTT(int *P, int op) {
  for (int i = 1; i < l; i++)
    if (i > r[i]) swap(P[i], P[r[i]]);
  for (int i = 1; i < l; i <<= 1) {
    int W = ksm(3, (mod - 1) / (i << 1));
    if (op < 0) W = ksm(W, mod - 2);
    w[0] = 1;
    for (int j = 1; j < i; j++) w[j] = 1ll * w[j - 1] * W % mod;
    for (int j = 0, p = i << 1; j < l; j += p)
      for (int k = 0; k < i; k++) {
        int X = P[j + k], Y = 1ll * P[j + k + i] * w[k] % mod;
        P[j + k] = (X + Y) % mod;
        P[j + k + i] = ((X - Y) % mod + mod) % mod;
      }
  }
  if (op < 0)
    for (int i = 0, inv = ksm(l, mod - 2); i < l; i++)
      P[i] = 1ll * P[i] * inv % mod;
}
int main() {
  cin >> n >> m;
  jc[0] = inv[0] = 1;
  m %= mod - 1;
  for (int i = 1; i <= n; i++)
    jc[i] = 1ll * jc[i - 1] * i % mod, inv[i] = ksm(jc[i], mod - 2);
  for (int i = 0; i <= n; i++) scanf("%d", &f[i]);
  for (int i = 0; i <= n; i++)
    A[i] = 1ll * jc[i] * f[i] % mod, B[i] = inv[n - i];
  for (l = 1, tt = 0; l <= 2 * n; l <<= 1) tt++;
  tt--;
  for (int i = 0; i < l; i++) r[i] = (r[i >> 1] >> 1) | ((i & 1) << tt);
  NTT(A, 1);
  NTT(B, 1);
  for (int i = 0; i < l; i++) A[i] = 1ll * A[i] * B[i] % mod;
  NTT(A, -1);
  for (int i = 0; i <= n; i++) g[i] = 1ll * A[n + i] * inv[i] % mod;
  for (int i = 0; i <= n; i++)
    g[i] = 1ll * g[i] * ksm(ksm(i + 1, mod - 2), m) % mod;
  for (int i = 0; i < l; i++) A[i] = B[i] = 0;
  for (int i = 0; i <= n; i++)
    A[i] = 1ll * jc[i] * g[i] % mod,
    B[i] = (n - i) & 1 ? mod - inv[n - i] : inv[n - i];
  NTT(A, 1);
  NTT(B, 1);
  for (int i = 0; i < l; i++) A[i] = 1ll * A[i] * B[i] % mod;
  NTT(A, -1);
  for (int i = 0; i <= n; i++) f[i] = 1ll * A[n + i] * inv[i] % mod;
  for (int i = 0; i <= n; i++) printf("%d ", f[i]);
  return puts(""), 0;
}
