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

#define int long long 
#define F first 
#define S second 
#define pb push_back 

const int mol=998244353;

bool vis[100005];

vector<vector<int>>mat,ori,tot;
void go(int id){
    if(id==1) tot=ori;
    else tot = mat;

    vector<vector<int>>iu;
    for(int i=0;i<2;i++){
        vector<int>tt;
        for(int j=0;j<2;j++){
            int sum=0;
            for(int k=0;k<2;k++){
                sum+=mat[i][k]*tot[k][j]%(mol-1);
                sum%=mol-1;
            }
            tt.pb(sum);
        }
        iu.pb(tt);
    }
    mat=iu;
}

int ff1(int g,int h){
    if(h==0) return 1;
    if(h==1) return g;
    if(h%2) return g*ff1(g,h-1)%(mol-1);
    else {
        int t=ff1(g,h/2);
        return t*t%(mol-1);
    }
}

int ff(int g,int h){
    if(h==0) return 1;
    if(h==1) return g;
    if(h%2) return g*ff(g,h-1)%mol;
    else {
        int t=ff(g,h/2);
        return t*t%(mol);
    }
}
vector<int>a(100005);

int n,k;

void dg(int ans,int t){
    t++;
    if(t==n+1) t=1;
    for(int i=0;i<n;i++){
        cout<<ans<<" ";
        ans*=ff(a[i],mol-2);
        ans%=mol;
        ans*=a[t-1];
        ans%=mol;
        t++;
        if(t==n+1) t=1;
    }
}
int dis[100005];//走幾圈了
int preans[100005];
int haha[100005];// 走到目標之前走幾步

void solve(){
    cin>>n>>k;
    for(int i=0;i<n;i++) cin>>a[i];
    for(int i=0;i<n;i++){
        if(i==0) preans[i]=a[i];
        else preans[i]=preans[i-1]*a[i]%mol;
    }

    int t=1;int lap=0;
    int cnt=0;
    while(vis[t]==0){
        dis[t]=lap;
        haha[t]=cnt;
        vis[t]=1;
        t+=t;lap+=lap;
        lap%=(mol-1);
        cnt++;
        k--;
        if(t>n) t-=n,lap++;
        if(k==0) break;
    }
    lap%=(mol-1);
    // cout<<cnt<<" "<<t<<" "<<lap<<" "<<k<<"\n";
    cnt-=haha[t],lap-=dis[t];
    if(lap<0) lap+=mol-1;
    // cout<<cnt<<" "<<lap<<"\n";
    // cout<<vis[t]<<"\n";
    // cout<<t<<"t\n";
    int ans=preans[t-1];
    
    // cout<<vis[t]<<"tt\n";
    if(!vis[t]){
        ans*=ff(preans[n-1],lap);ans%=mol;
        dg(ans,t);
        return;
    }
    int o1=ff1(2,cnt);
    // cerr<<o1<<"o1\n";
    vector<int>b={o1,0};
    ori.pb(b);
    b={lap,1};
    ori.pb(b);

    mat=ori;
    // b={lap,1};
    
    // mat.pb(b);mat.pb(b);
    k-=dis[t];k+=cnt;
    int total=k/(cnt);// 總週期
    total--;

    int le=k%cnt;
    // cout<<total<<"tt\n";

    vector<int>qq;

    while(total>1){
        if(total%2==0) total>>=1,qq.pb(2);
        else qq.pb(1),total--;
    }

    reverse(qq.begin(),qq.end());
    for(int ii:qq){
        // cerr<<mat[0][0]<<" "<<ii<<"\n";
        go(ii);
        // cerr<<mat[0][0]<<"mmmm\n";
    }
    preans[0]=1;
    
    int laap=(mat[0][0]*lap+mat[1][0])%(mol-1);// 總圈數
    if(total==0) laap=lap;
    // cout<<ans<<" "<<laap<<" "<<preans[n-1]<<"\n";
    ans*=ff(preans[n-1],laap);ans%=mol;
    // cout<<ans<<" "<<le<<"\n";
    // cerr<<le<<"lee\n";
    lap=laap;
    while(le){
        le--,ans*=ff(preans[n-1],lap);ans%=mol;
        lap+=lap;
        lap%=mol-1;
        int pp=t;
        t+=t;
        if(t>n) t-=n;
        if(t<pp){
            ans*=preans[t-1]*preans[n-1]%mol*ff(preans[pp-1],mol-2)%mol;
            ans%=mol;
        }
        else{
            ans*=preans[t-1]*ff(preans[pp-1],mol-2)%mol;
            ans%=mol;
        }
        ans%=mol;
    }
    dg(ans,t);



    return;

    b=a;
    for(int i=0;i<k;i++){
        a=b;
        for(int j=0;j<n;j++) b[j]=a[j]*a[(j+(1LL<<i))%n]%mol;
        int sum=0;
        for(int j=0;j<n;j++) cout<<b[j]<<" ",sum+=b[j];
        cout<<"\n"<<sum<<"\n";
    }
    //100000
}

signed main(){
    ios::sync_with_stdio(0);cin.tie(0);
    solve();
    return 0;
}