#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
#define rep2(i, s, n) for (ll i = ll(s); i < ll(n); i++)
using ll = long long;
using P = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
#define all(a) a.begin(), a.end()
#define pb push_back
const int inf = 1e9;
const ll linf = 2e18;

template<class T>
bool chmin(T &a, T b) {
  if(a > b) {
    a = b;
    return true;
  }
  return false;
}

template<class T>
bool chmax(T &a, T b) {
  if(a < b) {
    a = b;
    return true;
  }
  return false;
}

const int mod = 998244353;

ll mod_pow(ll a, ll t) {
  ll res = 1, now = a % mod;
  while(t) {
    if(t & 1) {
      res *= now;
      res %= mod;
    }
    now *= now;
    now %= mod;
    t >>= 1;
  }
  return res;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n,k;
  cin >> n >> k;
  vector<int> a(n);
  rep(i, n) cin >> a[i];
  ll aq = 0, ar = 1;
  ll nq = 0, nr = 2;
  nq += nr / n;
  nr %= n;
  auto calc = [&n](ll aq, ll ar, ll nq, ll nr) {
      ll tq = 0, tr = 0;
      tq += aq * nq % (mod-1) * n % (mod-1);
      tq += aq * nr + nq * ar;
      tq %= mod-1;
      tr = ar * nr;
      tq += tr / n;
      tr %= n;
      tq %= mod-1;
      return make_pair(tq, tr);
  };
  while(k) {
    if(k&1) {
      tie(aq, ar) = calc(aq, ar, nq, nr);
    }
    tie(nq, nr) = calc(nq, nr, nq, nr);
    k >>= 1;
  }
  cerr << aq << ' ' << ar << endl;
  vector<ll> p(2*n+1);
  p[0] = 1;
  rep(i, 2 * n) {
    p[i+1] = p[i] * a[i%n];
    p[i+1] %= mod;
  }
  ll all = mod_pow(p[n], aq);
  rep(i, n) {
    ll ans = all;
    ans *= p[i+ar];
    ans %= mod;
    ans *= mod_pow(p[i], mod-2);
    ans %= mod;
    cout << ans << " \n"[i==n-1];
  }
}