NTT:
#include<iostream>
using namespace std;namespace OIfast{char buf[1<<21],*p1,*p2,*top,buffer[1<<21];#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?0:*p1++)#define gc getchar()inline int read(){int n=0;static char c=gc;while(!isdigit(c))c=gc;while(isdigit(c))n=(n<<3)+(n<<1)+(c^48),c=gc;return n;}}using namespace OIfast;namespace NTT{const int N=2e6+5;const int p=998244353;const int g=3,inv_g=332748118;int n,m;int lim=1,idx;int A[N<<1],B[N<<1];int r[N];inline int mul(int a,int b){return (1LL*a)*(1LL*b)%p;}inline void mult(int &a,int b){return a=mul(a,b),void();}inline int qpow(int a,int b){int res=1;while(b){if(b&1)mult(res,a);mult(a,a),b>>=1;}return res;}inline int inv(int x){return qpow(x,p-2);}inline void init(){while(lim<=n+m)lim<<=1,++idx;for(int i=0;i<lim;++i)r[i]=((r[i>>1]>>1)|((i&1)<<(idx-1)));return ;}inline void ntt(int *f,int op){for(int i=0;i<lim;++i)if(i<r[i])swap(f[i],f[r[i]]);for(int i=1;i<lim;i<<=1){int wn=qpow((~op)?g:inv_g,(p-1)/(i<<1));for(int j=0;j<lim;j+=(i<<1)){int w=1;for(int k=0;k<i;++k,mult(w,wn)){int y=f[j+k],z=mul(w,f[i+j+k]);f[j+k]=(y+z)%p,f[i+j+k]=(y-z+p)%p;}}}if(~op)return ;int inv_lim=inv(lim);for(int i=0;i<lim;++i)mult(f[i],inv_lim);return ;}inline void solve(){n=read(),m=read();init();for(int i=0;i<=n;++i)A[i]=read();for(int i=0;i<=m;++i)B[i]=read();ntt(A,1),ntt(B,1);for(int i=0;i<lim;++i)mult(A[i],B[i]);ntt(A,-1);for(int i=0;i<=n+m;++i)printf("%d ",A[i]);return printf("\n"),void();}}using namespace NTT;signed main(){return solve(),0;
}