#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int mod = 998244353;
int add(int a, int b){
	return (a + b > mod) ? (a + b - mod) : (a + b);
}
int sub(int a, int b){
	return (a - b < 0) ? (a - b + mod) : (a - b);
}
int mult(int a, int b){
	return 1LL* a * b % mod;
}
int binpow(int a, int n){
	int res = 1;
	while(n){
		if(n & 1)
			res = mult(res, a);
		a = mult(a, a);
		n /= 2;
	}
	return res;
}

int inv(int x)
{
	return binpow(x, mod - 2);
}
int bw(int k, int n){
	int res = 1;
	int a = 2;
	while(k){
		if(k & 1)
			res = 1ll * res * a % n;
		a = 1ll * a * a % n;
		k /= 2;
	}
	return res;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int n, k;
	cin >> n >> k;
	VI a(n);
	FOR (i, 0, n) cin >> a[i];
	VI pr(n + 1, 1);
	VI ipr(n + 1, 1);
	FOR (i, 0, n) 
	{
		pr[i + 1] = mult(pr[i], a[i]);
		ipr[i + 1] = inv(pr[i + 1]);
	}
	int all = pr[n];
	int pos = bw(k, n);
	
	int cnt = mult(sub(binpow(2, k), pos), inv(n));
	
	int pachka = binpow(all, cnt);
	if(pos == 0){
		FOR(i, 0, n)
			cout << pachka << " ";
		cout << endl;
		return 0;
	}
	FOR (i, 0, n)
	{
		//[i, pos)
		int res = pachka;
		if(pos < i){
			int cur = pr[pos];
			cur = mult(cur, mult(all, ipr[i]));
			res = mult(res, cur);
		}else{
			res = mult(res, mult(pr[pos], ipr[i]));
		}
		cout << res << " ";
		pos = (pos + 1) % n;
	}
	cout << endl;
	
	return 0;
}