#include <cstdio>
#include <cstring>
#define add(x,y) (x + y >= (mod - 1) ? x + y - (mod - 1) : x + y)
#define dec(x,y) (x < y ? x - y + (mod - 1) : x - y)
using namespace std;
const int N = 1e6;
const int mod = 998244353;
inline int fpow(int a,int b)
{
	int ret = 1;
	for(;b;b >>= 1)
		(b & 1) && (ret = (long long)ret * a % mod),a = (long long)a * a % mod;
	return ret;
}
int n,k;
int f[N + 5],g[N + 5];
int vis[N + 5],cnt,prime[N + 5],c[N + 5];
int inv[25];
void ln(int *f,int n)
{
	for(register int i = 1;i <= n;++i)
		g[i] = (long long)f[i] * c[i] % mod;
	for(register int i = 1;i <= n;++i)
	{
		for(register int j = 2;i * j <= n;++j)
			g[i * j] = (g[i * j] - (long long)g[i] * f[j] % mod + mod) % mod;
		i > 1 && (g[i] = (long long)g[i] * inv[c[i]] % mod);
	}
	for(register int i = 1;i <= n;++i)
		f[i] = g[i];
}
void exp(int *f,int n)
{
	memset(g + 1,0,sizeof(int) * n),g[1] = 1;
	for(register int i = 1;i <= n;++i)
		f[i] = (long long)f[i] * c[i] % mod;
	for(register int i = 1;i <= n;++i)
	{
		i > 1 && (g[i] = (long long)g[i] * inv[c[i]] % mod);
		for(register int j = 2;i * j <= n;++j)
			g[i * j] = (g[i * j] + (long long)g[i] * f[j]) % mod;
	}
	for(register int i = 1;i <= n;++i)
		f[i] = g[i];
}
int ans;
int main()
{
	scanf("%d%d",&n,&k),k = fpow(k,mod - 2);
	for(register int i = 2;i <= n;++i)
	{
		if(!vis[i])
			c[prime[++cnt] = i] = 1;
		for(register int j = 1;j <= cnt && i * prime[j] <= n;++j)
		{
			vis[i * prime[j]] = 1,c[i * prime[j]] = c[i] + 1;
			if(!(i % prime[j]))
				break;
		}
		ans = ans < c[i] ? c[i] : ans;
	}
	inv[1] = 1;
	for(register int i = 2;i <= 20;++i)
		inv[i] = (long long)(mod - mod / i) * inv[mod % i] % mod;
	for(register int i = 1;i <= n;++i)
		scanf("%d",f + i);
	ln(f,n);
	for(register int i = 1;i <= n;++i)
		f[i] = (long long)f[i] * k % mod;
	exp(f,n);
	for(register int i = 1;i <= n;++i)
		printf("%d%c",f[i]," \n"[i == n]);
}