#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10, G = 3, size = 1 << 20, mod = 998244353, inf = 2e9;
const long long INF = 1e15;
template <class o>
void qr(o& x) {
  char c = getchar();
  x = 0;
  int f = 1;
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) x = x * 10 + c - '0', c = getchar();
  x *= f;
}
template <class o, class... O>
void qr(o& x, O&... y) {
  qr(x);
  qr(y...);
}
template <class o>
void qw(o x) {
  if (x / 10) qw(x / 10);
  putchar(x % 10 + '0');
}
template <class o>
void pr1(o x) {
  if (x < 0) x = -x, putchar('-');
  qw(x);
  putchar(' ');
}
template <class o, class... O>
void pr1(o x, O... y) {
  pr1(x);
  pr1(y...);
}
template <class o>
void pr2(o x) {
  if (x < 0) x = -x, putchar('-');
  qw(x);
  putchar(10);
}
template <class o, class... O>
void pr2(o x, O... y) {
  pr2(x);
  pr2(y...);
}
template <class o>
void cmax(o& x, o y) {
  if (x < y) x = y;
}
template <class o>
void cmin(o& x, o y) {
  if (x > y) x = y;
}
template <typename t1, typename t2>
void ad(t1& x, t2 y) {
  x += y;
  if (x >= mod) x -= mod;
}
template <typename t1, typename t2>
void dl(t1& x, t2 y) {
  x -= y;
  if (x < 0) x += mod;
}
int n, R[N << 2];
long long f[N << 2], g[N << 2], jc[N], inv[N], m;
long long power(long long a, long long b = mod - 2) {
  long long c = 1;
  ((b %= mod - 1) += mod - 1) %= mod - 1;
  for (; b; b /= 2, a = a * a % mod)
    if (b & 1) c = c * a % mod;
  return c;
}
void NTT(long long* A, int len, int o) {
  for (int i = 1; i <= len - 1; i++)
    if (i < R[i]) swap(A[i], A[R[i]]);
  for (int h = 2; h <= len; h *= 2) {
    long long wn = power(G, (mod - 1) / h * o);
    for (int j = 0; j < len; j += h) {
      long long w = 1;
      for (int i = 0; i <= h / 2 - 1; i++) {
        long long u = A[i + j], v = A[i + j + h / 2] * w;
        A[i + j] = (u + v) % mod;
        A[i + j + h / 2] = (u - v) % mod;
        w = w * wn % mod;
      }
    }
  }
  if (o == -1)
    for (int i = 0, v = -(mod - 1) / len; i < len; i++) A[i] = A[i] * v % mod;
}
void solve() {
  qr(n, m);
  jc[0] = 1;
  for (int i = 1; i <= n; i++) jc[i] = jc[i - 1] * i % mod;
  inv[n] = power(jc[n]);
  for (int i = n; i >= 1; i--) inv[i - 1] = inv[i] * i % mod;
  int len = 2;
  while (len < (n + 1) * 2) len *= 2;
  for (int i = 1; i <= len - 1; i++)
    R[i] = R[i >> 1] >> 1 | (i & 1 ? len >> 1 : 0);
  for (int i = 0; i <= n; i++) {
    qr(f[n - i]);
    f[n - i] = f[n - i] * jc[i] % mod;
    g[i] = inv[i];
  }
  NTT(f, len, 1);
  NTT(g, len, 1);
  for (int i = 0; i <= len - 1; i++) g[i] = g[i] * f[i] % mod;
  NTT(g, len, -1);
  for (int i = 0; i <= n; i++)
    g[n - i] = g[n - i] * power(power(i + 1, m)) % mod;
  for (int i = n + 1; i <= len - 1; i++) g[i] = 0;
  NTT(g, len, 1);
  memset(f, 0, sizeof f);
  for (int i = 0; i <= n; i++) f[i] = inv[i] * (i & 1 ? -1 : 1);
  NTT(f, len, 1);
  for (int i = 0; i <= len - 1; i++) f[i] = f[i] * g[i] % mod;
  NTT(f, len, -1);
  long long v;
  for (int i = 0; i <= n; i++) {
    v = f[n - i] * inv[i] % mod;
    v = (v + mod) % mod;
    pr1(v);
  }
}
int main() {
  int T = 1;
  while (T--) solve();
  return 0;
}
