uoj34 NTT

#include<bits/stdc++.h>
#define MO 998244353
#define M 262155
using namespace std;
inline int read()
{
	int ret=0; char c=getchar(); 
	while(c<48||c>57)c=getchar();
	while(c>=48&&c<=57)ret=ret*10+c-48,c=getchar();
	return ret;
}

int N,v[45],tmp[M],wn[M],WN,*ans,&tt=WN,n,m,a[M],b[M];   

inline int ksm(int p, int k)
{
	v[0]=p;
	for(int i=1; i<=29;++i)v[i]=(long long)v[i-1]*v[i-1]%MO;
	int s=1;
	for(int i=29; i>=0; --i){
		if(1<<i<=k){
			k-=1<<i;
			s=(long long)s*v[i]%MO;
		}
	}
	return s;
}

inline void init_wn()
{
	WN=ksm(3,(MO-1)/N);
	wn[0]=1;
	for(int i=1; i<=N; ++i)wn[i]=(long long)wn[i-1]*WN%MO;
}

inline void rev_wn()
{
	for(int i=0; i<=N; ++i)tmp[i]=wn[N-i];
	for(int i=0; i<=N; ++i)wn[i]=tmp[i];
} 

void fft(int n, int s1 ,int mi)
{
	if(n==1)return;
	int m=n>>1,len=1<<mi,s2=s1+len;
	fft(m,s1,mi+1); fft(m,s2,mi+1);
	int p=s1;
	for(int i=0; i<m; ++i,p+=len<<1){
		int del=(long long)ans[p+len]*wn[i<<mi]%MO;
		tmp[i]=(ans[p]+del)%MO;
		tmp[i+m]=(ans[p]+MO-del)%MO;
	}
	for(int i=0; i<n; ++i)ans[s1+(i<<mi)]=tmp[i];
}

int main()
{
	n=read(); m=read();
	for(int i=0; i<=n; ++i)a[i]=read();
	for(int i=0; i<=m; ++i)b[i]=read();
	N=1; while(N<=n+m)N<<=1;
	
	init_wn();
	ans=a;
	fft(N,0,0);
	ans=b;
	fft(N,0,0);
	for(int i=0; i<N; ++i)a[i]=(long long)a[i]*b[i]%MO;
	rev_wn();
	ans=a;
	fft(N,0,0);
	for(int i=0; i<=n+m; ++i)printf("%d ",(long long)a[i]*ksm(N,MO-2)%MO);	
}