/*
	www.youtube.com/YugiHackerChannel
	linktr.ee/YugiHacker
*/
#include<bits/stdc++.h>
#define el cout<<"\n"
#define f0(i,n) for(int i=0;i<n;++i)
#define f1(i,n) for(int i=1;i<=n;++i)
#define maxn 100005
#define int long long
#define MOD 998244353
using namespace std;
int n, k, a[maxn];
long long P = 1, I = 1, R, X = 0;

long long Pow(long long a, long long n)
{
    a %= MOD;
    long long ans = 1;
    for (;n;n/=2, a=a*a%MOD) if (n&1) (ans *= a) %= MOD;
    return ans;
}

void solve(int k) {
    if (k == 0) {
        R = 1;
        X = 0;
        return;
    }
    solve(k/2);
    X = (X * X % (MOD - 1) * n % (MOD - 1) + 2 * X * R + R * R / n) % (MOD - 1);
    R = R * R % n;
    if (k & 1) {
        X = (X * 2 + R * 2 / n) % (MOD - 1);
        R = R * 2 % n;
    }
}

void calc() {
    long long r = 1;

    while (k) {
        I = I * I % MOD * Pow(P, n) % MOD;
        r = r * r;
        if (k & 1) r *= 2;
        int x = r / n;
        r %= n;
        if (r == 0) r = n, x--;
        I = I * Pow(P, x) % MOD;
        k /= 2;
    }


//    for (int i=0; i<k; i++) {
//        I = I * I % MOD;
//        r *= 2;
//        if (r > n) I = I * P % MOD, r -= n;
//    }
    R = r;
}


main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //freopen("input.txt", "r", stdin);
    cin >> n >> k;
    f0 (i, n) cin >> a[i], (P *= a[i]) %= MOD;
    long long cur = 1;

    solve(k);

    I = Pow(P, X);

    for (int i=0; i<R-1; i++) {
        cur *= a[i];
    }

    ///cout << X << ' ' << R <<  ' ' << I <<' ' << cur, el;

    if (R == 0) {
        for (int i=0; i<n; i++) cout << I << ' ';
        return 0;
    }

    for (int i=0; i<n; i++) {
        cur *= a[(i+R-1)%n];
        cur %= MOD;
        cout << cur * I % MOD << ' ';
        cur = cur * Pow(a[i], MOD - 2) % MOD;
    }
}