#include #include #include #define LL long long #define Re register int using namespace std; const int N=262144+3,P=998244353,G=3,phi=P-1; inline void in(Re &x){ int f=0;x=0;char ch=getchar(); while(ch<'0'||ch>'9')f|=ch=='-',ch=getchar(); while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar(); x=f?-x:x; } inline int in_(){ int f=0;LL x=0;char ch=getchar(); while(ch<'0'||ch>'9')ch=getchar(); while(ch>='0'&&ch<='9')x=x*10+(ch^48),x%=P,ch=getchar(); return x; } inline int mi(Re x,Re k){ Re s=1; while(k){ if(k&1)s=(LL)s*x%P; x=(LL)x*x%P,k>>=1; } return s; } inline int inv(Re x){return mi(x,P-2);} int invG,tr[N]; inline void NTT(Re *f,Re n,Re op){ for(Re i=1;i>1,w1=mi(op?invG:G,(P-1)/p);st>1]>>1)|((i&1)?n>>1:0); NTT(f,n,0),NTT(g,n,0); for(Re i=0;i>=1; } } int n,K,f[N],g[N]; int main(){ // freopen("123.txt","r",stdin); in(n),--n,K=in_(); for(Re i=0;i<=n;++i)in(f[i]); polymi(f,n,K,g); for(Re i=0;i<=n;++i)printf("%d ",g[i]); }