#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=998244353;
const int maxn=1e6+100;
int a[maxn];
int p[maxn];
int n,k;
int qpow(int x,int p,int mo){
    int ans=1;
    while(p){
        if(p&1){
            ans*=x;
            ans%=mo;
        }
        x*=x;
        x%=mo;
        p/=2;
    }
    return ans;
}
int ans=1;
int tmp=1;
int ret=0;
pair<int,int> qp2(int k,int mo=mod-1){
    pair<int,int>x=make_pair(0,2);
    pair<int,int>ans=make_pair(0,1);
    while(k){
        
        if(k&1){
            int ret1=ans.first;
            int ret2=x.first;
            int x1=ans.second;
            int x2=x.second;
            ans.first=(ret1*ret2*n+ret2*x1+ret1*x2+x1*x2/n)%mo;
            ans.second=(x1*x2%n)%mo;
        }
        
        int ret1=x.first;
        int ret2=x.first;
        // cout<<"A"<<endl;
        int x1=x.second;
        int x2=x.second; 
        // cout<<"A"<<endl;
        x.first=((ret1*ret2)%mo*n%mo+ret2*x1%mo+ret1*x2%mo+x1*x2/n)%mo;
        //  cout<<"A"<<endl;
        x.second=(x1*x2%n)%mo;
        //  cout<<"A"<<endl;
        k/=2;
    }
    return ans;    
}
signed main(){
    scanf("%lld%lld",&n,&k);
    for(int i=0;i<n;i++){
        scanf("%lld",&a[i]);
        if(i==0) p[i]=a[i]%mod;
        else p[i]=(p[i-1]*a[i])%mod;
    }
    // ret=qpow(2,k,mod-1);
    // ret=(ret*qpow(n,mod-3,mod-1))%(mod-1);
    pair<int,int>tur=qp2(k);
    ans=qpow(p[n-1],tur.first,mod);
    tmp=tur.second;
    if(tmp>=1) (ans=ans*p[tmp-1])%=mod;
    printf("%lld ",ans);
    for(int i=1;i<n;i++){
        ans=(ans*qpow(a[i-1],mod-2,mod))%mod;
        ans=(ans*a[(i+tmp-1)%n])%mod;
        printf("%lld ",ans);
    }
    return 0;
}