#include<iostream>
using namespace std;
typedef long long ll;
const int p = 998244353;
const int MAXN = 100005;
int n=0,k=0;
int f[MAXN]={},g[MAXN]={},tmp[MAXN]={};
void dirichlet(int* a,int* b)// a = a * b
{
    //for(int i=1;i<=n;++i){cout<<a[i]<<" ";}cout<<"\n";
    //for(int i=1;i<=n;++i){cout<<b[i]<<" ";}cout<<"\n\n";
    for(int i=1;i<=n;++i){tmp[i] = 0;}
    for(int i=1;i<=n;++i){
        for(int j=1;i*j<=n;++j){
            tmp[i*j] += 1ll*a[i]*b[j]%p;
            if(tmp[i*j] >= p){tmp[i*j]-=p;}
        }
    }
    for(int i=1;i<=n;++i){
        a[i] = tmp[i];
    }
}
void dirichlet_quick_pow(ll b)
{
    while(b){
        if(b&1){
            dirichlet(f,g);// f = f * g
        }
        dirichlet(g,g);
        //for(int i=1;i<=n;++i){cout<<g[i]<<" ";}cout<<"\n";
        b>>=1;
    }
}
ll quick_pow(ll a,ll b)
{
    ll ans = 1;
    while(b)
    {
        if(b&1){
            ans = ans*a%p;
        }
        a = a*a%p;
        b >>= 1;
    }
    return ans;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>k;
    for(int i=1;i<=n;++i){
        cin>>g[i];
    }
    f[1] = 1;
    dirichlet_quick_pow(quick_pow(k,p-2));
    for(int i=1;i<=n;++i){
        cout<<f[i]<<" ";
    }cout<<"\n";
    return 0;
}