#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
const long long p = 998244353;
long long n, m, v[MAXN], fact[MAXN];
namespace fft {
void fft(vector<complex<double> > &a, bool inv) {
  int n = a.size(), j = 0;
  vector<complex<double> > roots(n / 2);
  for (int i = 1; i < n; i++) {
    int bit = (n >> 1);
    while (j >= bit) {
      j -= bit;
      bit >>= 1;
    }
    j += bit;
    if (i < j) swap(a[i], a[j]);
  }
  double ang = 2 * acos(-1) / n * (inv ? -1 : 1);
  for (int i = 0; i < n / 2; i++) {
    roots[i] = complex<double>(cos(ang * i), sin(ang * i));
  }
  for (int i = 2; i <= n; i <<= 1) {
    int step = n / i;
    for (int j = 0; j < n; j += i) {
      for (int k = 0; k < i / 2; k++) {
        complex<double> u = a[j + k], v = a[j + k + i / 2] * roots[step * k];
        a[j + k] = u + v;
        a[j + k + i / 2] = u - v;
      }
    }
  }
  if (inv)
    for (int i = 0; i < n; i++) a[i] /= n;
}
vector<long long> multiply(vector<long long> &v, vector<long long> &w) {
  vector<complex<double> > fv(v.begin(), v.end()), fw(w.begin(), w.end());
  int n = 1;
  while (n < max(v.size(), w.size())) n <<= 1;
  n <<= 1;
  fv.resize(n);
  fw.resize(n);
  fft(fv, 0);
  fft(fw, 0);
  for (int i = 0; i < n; i++) fv[i] *= fw[i];
  fft(fv, 1);
  vector<long long> ret(n);
  for (int i = 0; i < n; i++) ret[i] = (long long)round(fv[i].real());
  return ret;
}
vector<long long> multiply(vector<long long> &v, vector<long long> &w,
                           long long mod) {
  int n = 1;
  while (n < max(v.size(), w.size())) n <<= 1;
  n <<= 1;
  vector<complex<double> > v1(n), v2(n);
  vector<complex<double> > r1(n), r2(n);
  for (int i = 0; i < v.size(); i++) {
    v1[i] = complex<double>(v[i] >> 15, v[i] & 32767);
  }
  for (int i = 0; i < w.size(); i++) {
    v2[i] = complex<double>(w[i] >> 15, w[i] & 32767);
  }
  fft(v1, 0);
  fft(v2, 0);
  for (int i = 0; i < n; i++) {
    int j = (i ? (n - i) : i);
    complex<double> ans1 = (v1[i] + conj(v1[j])) * complex<double>(0.5, 0);
    complex<double> ans2 = (v1[i] - conj(v1[j])) * complex<double>(0, -0.5);
    complex<double> ans3 = (v2[i] + conj(v2[j])) * complex<double>(0.5, 0);
    complex<double> ans4 = (v2[i] - conj(v2[j])) * complex<double>(0, -0.5);
    r1[i] = (ans1 * ans3) + (ans1 * ans4) * complex<double>(0, 1);
    r2[i] = (ans2 * ans3) + (ans2 * ans4) * complex<double>(0, 1);
  }
  fft(r1, 1);
  fft(r2, 1);
  vector<long long> ret(n);
  for (int i = 0; i < n; i++) {
    long long av = (long long)round(r1[i].real());
    long long bv =
        (long long)round(r1[i].imag()) + (long long)round(r2[i].real());
    long long cv = (long long)round(r2[i].imag());
    av %= mod, bv %= mod, cv %= mod;
    ret[i] = (av << 30) + (bv << 15) + cv;
    ret[i] %= mod;
    ret[i] += mod;
    ret[i] %= mod;
  }
  return ret;
}
}  // namespace fft
long long exp(long long x, long long k) {
  if (k == 0) return 1;
  if (k % 2 == 1) return x * exp(x, k - 1) % p;
  long long y = exp(x, k / 2);
  return y * y % p;
}
long long inv(long long x) { return exp(x, p - 2); }
int main() {
  cin >> n >> m;
  n++;
  for (int i = 0; i < n; ++i) {
    cin >> v[i];
    v[i] = (p + v[i]) % p;
  }
  fact[0] = 1;
  for (int i = 1; i <= n; ++i) fact[i] = i * fact[i - 1] % p;
  vector<long long> f, g;
  f.resize(n);
  g.resize(n);
  for (int i = 0; i < n; ++i) {
    f[i] = inv(fact[i]);
    g[i] = fact[i] * v[i] % p;
  }
  reverse(g.begin(), g.end());
  vector<long long> q = fft::multiply(f, g, p);
  q.resize(n);
  reverse(q.begin(), q.end());
  for (int i = 0; i < n; ++i) q[i] = q[i] * inv(fact[i]) % p;
  for (int i = 0; i < n; ++i) q[i] = q[i] * exp(inv(i + 1), m) % p;
  for (int i = 0; i < n; ++i) {
    f[i] = inv(fact[i]);
    g[i] = fact[i] * q[i] % p;
    if (i % 2 == 1) g[i] = (p - g[i]) % p;
  }
  reverse(g.begin(), g.end());
  q = fft::multiply(f, g, p);
  q.resize(n);
  reverse(q.begin(), q.end());
  for (int i = 0; i < n; ++i) {
    long long x = q[i] * inv(fact[i]) % p;
    if (i % 2 == 1) x = (p - x) % p;
    cout << x << ' ';
  }
  cout << endl;
}
