本地过了第一个点，提交死活不过……

#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<iostream>
#include<cstring>
#include<memory.h>
#include<map>
#include<set>
#include<queue>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long LL;
LL mod=998244353,g=3,ig=332748118,maxn=4000005;
int n,m,L,r[4000005],lg[8000008];
LL a[4000005],b[4000005];
inline LL Pow(LL x,int t)
{
	LL res=1;
	for(;t;t>>=1,x=x*x%mod)
	if(t&1)res=res*x%mod;
    return res;
}
inline void init(int n){rep(i,0,n-1)r[i]=(r[i>>1]>>1)|((i&1)<<(lg[n]-1));}
inline void ntt(LL *a,int f,int n)
{
	rep(i,0,n-1)if(i<r[i])swap(a[i],a[r[i]]);
	for(int i=1;i<n;i<<=1)
	{
		LL wn=Pow(((f==1)?g:ig),(mod-1)/(i<<1));
		for(int j=0;j<n;j+=(i<<1))
		{
			LL w=1;
			for(int k=0;k<i;k++,w=(w*wn)%mod)
			{
				LL x=a[j+k],y=(w*a[j+k+i])%mod;
				a[j+k]=(x+y)%mod;
				a[j+k+i]=((x-y)%mod+mod)%mod;
			}
		}
	}
	if(f==-1)
	{
		LL inv=Pow(n,mod-2); 
		rep(i,0,n-1)a[i]=a[i]*inv%mod;
	}
}
int main()
{
	cin>>n>>m;
	//cout<<pow(3,5)<<endl;
	lg[0]=-1;
	rep(i,1,maxn*2-1)lg[i]=lg[i>>1]+1;
	rep(i,0,n)scanf("%lld",a+i);
	rep(i,0,m)scanf("%lld",b+i);
	int N;
	for(N=n+m,n=1;n<=N;n<<=1);
	init(n);
	ntt(a,1,n);
	//rep(i,0,n-1)cout<<a[i]<<' ';puts("");
	ntt(b,1,n);
	rep(i,0,n-1)a[i]=a[i]*b[i]%mod;
	ntt(a,-1,n);
	rep(i,0,N)printf("%lld ",a[i]);
}