#include <bits/stdc++.h>
using namespace std;
#define fastio (ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL))
typedef long long ll;
typedef long double lld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int MAXSIZE = 2000000;
const long long INF = 1e18 + 5;
const double EPSILON = 1e-14;
const ll DIV = 998244353;
const long double pi = 3.14159265358979323846264338327950288419716939937510L;

ll n, k;
ll arr[101011];
ll mula[101011];
ll pinv[101011];

ll POW(ll a, ll r, ll D)
{
    ll ret = 1;
    while (r)
    {
        if (r & 1)
        {
            ret = ret * a % D;
        }

        r >>= 1;
        a = (a * a) % D;
    }
    return ret;
}
ll opi(ll a)
{
    ll t = a;
    vector<ll> v;
    for (ll i = 2; i * i <= t; i++)
    {
        if (t % i == 0)
        {
            while (t % i)
                t /= i;
            v.push_back(i);
        }
    }
    if (t > 1)
        v.push_back(t);
    for (auto i : v)
        a = a * (i - 1) / i;
    return a;
}

ll ans[101011];
int main()
{
    fastio;
    cin >> n >> k;

    mula[0] = 1;
    pinv[0] = 1;
    for (int i = 1; i <= n; i++)
    {
        cin >> arr[i];
        mula[i] = mula[i - 1] * arr[i] % DIV;
        pinv[i] = pinv[i - 1] * POW(arr[i], DIV - 2, DIV) % DIV;
    }
    if (k == 0)
    {
        for (int i = 1; i <= n; i++)
            cout << arr[i] << " ";
        return 0;
    }
    ll k2 = POW(2, k, DIV);
    ll kn = k2 % n;
    ll pi = opi(DIV - 1);
    for (int i = 1; i <= n; i++)
    {
        ans[i] = POW(mula[n], (POW(2, k, DIV - 1) / n), DIV) % DIV;

        if (ans[i] == 0)
            ans[i] = 1;
        if (kn)
        {
            if (i + kn - 1 > n)
            {
                ans[i] = ans[i] * mula[n] % DIV * pinv[i - 1] % DIV * mula[(i + kn - 1 - n)] % DIV;
            }
            else
            {
                ans[i] = ans[i] * mula[i + kn - 1] % DIV * pinv[i - 1] % DIV;
            }
        }
    }
    for (int i = 1; i <= n; i++)
        cout << ans[i] << " ";

    return 0;
}