#include <bits/stdc++.h>
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fd(i,a,b) for(int i=a;i>=b;--i)
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define mo 998244353
#define N 2400005
#define ad(x,y) x+=y,x-=(x>=mo?mo:0)
using namespace std;
inline char gc()
{
	static char buf[1048576],*p1,*p2;
 	return p1==p2&&(p2=(p1=buf)+fread(buf,1,1048576,stdin),p1==p2)?EOF:*p1++;
}
inline int read()
{
	char ch=gc();int r=0,w=1;
	for(;ch<'0'||ch>'9';ch=gc())if(ch=='-')w=-1;
	for(;'0'<=ch&&ch<='9';ch=gc())r=r*10+(ch-'0');
	return r*w;
}
inline void write(int x)
{
	if(!x)return putchar('0'),putchar(' '),void(); 
	char ch[15];ch[0]=' ';
	int tot=0;
	while(x)ch[++tot]=x%10+48,x/=10;
	fd(i,tot,0)putchar(ch[i]);
}
int r[N],ginv[N],yg[25],iyg[25],jc[N],inv[N],zq[N];
int ksm(int x,int y)
{
	if(!y)return 1;
	int z=ksm(x,y>>1);
	return((y&1)?1ll*z*z%mo*x%mo:1ll*z*z%mo);
}
int C(int x,int y)
{
	return 1ll*jc[x]*inv[y]%mo*inv[x-y]%mo;
}
struct poly{
	vector<int> a;
	void ntt(int x,int inv)
	{
		fo(i,0,x-1)if(i>(r[i]=(i&1)*x+r[i>>1]>>1))swap(a[i],a[r[i]]);
		for(int len=2,ct=1;len<=x;len<<=1,ct++)
		{
			int mi=len>>1,zqr=(inv<0?iyg[ct]:yg[ct]);
			zq[1]=1;fo(k,2,mi)zq[k]=1ll*zq[k-1]*zqr%mo; 
			for(int wz=0;wz<x;wz+=len)
			{
				fo(k,1,mi)
				{
					int ji=1ll*a[wz+mi+k-1]*zq[k]%mo;
					a[wz+mi+k-1]=a[wz+k-1];
					ad(a[wz+mi+k-1],mo-ji);
					ad(a[wz+k-1],ji);
				}
			}
		}
		if(inv<0)
		{
			int nm=ksm(x,mo-2);
			fo(i,0,x-1)a[i]=1ll*a[i]*nm%mo;
		}
	}
	void dao()
	{
		fo(i,1,a.size()-1)a[i-1]=1ll*a[i]*i%mo;
		a[a.size()-1]=0;
	}
	void jifen()
	{
		fd(i,a.size()-1,1)a[i]=1ll*a[i-1]*ginv[i]%mo;
		a[0]=0;
	}
	void res(int x)
	{
		a.resize(x);
	}
	friend poly operator *(poly A,poly B)
	{
		int x=1,tp=A.a.size()+B.a.size()-1;
		while(x<tp)x<<=1;
		A.res(x),B.res(x);
		A.ntt(x,1);B.ntt(x,1);
		fo(i,0,x-1)A.a[i]=1ll*A.a[i]*B.a[i]%mo;
		A.ntt(x,-1);
		A.res(tp);
		return A;
	}
	friend poly operator +(poly A,poly B)
	{
		int sz=max(A.a.size(),B.a.size());
		A.res(sz),B.res(sz);
		fo(i,0,sz-1)ad(A.a[i],B.a[i]);
		return A;
	}	
	friend poly operator -(poly A,poly B)
	{
		int sz=max(A.a.size(),B.a.size());
		A.res(sz),B.res(sz);
		fo(i,0,sz-1)ad(A.a[i],mo-B.a[i]);
		return A;
	}
	poly dinv(poly A)
	{
		int x=1,sz=A.a.size();
		while(x<sz)x<<=1;
		poly G,B=A;
		B.res(x),G.res(1);
		G.a[0]=ksm(A.a[0],mo-2);
		for(int i=2;i<=x;i<<=1)
		{
			int lenn=i<<1;
			A.res(lenn);G.res(lenn);
			fo(ii,0,i-1)A.a[ii]=B.a[ii];
			fo(ii,i,lenn-1)A.a[ii]=G.a[ii]=0;
			G.ntt(lenn,1);A.ntt(lenn,1);
			fo(ii,0,lenn-1)G.a[ii]=1ll*G.a[ii]*(2-1ll*G.a[ii]*A.a[ii]%mo+mo)%mo;
			G.ntt(lenn,-1);
			fo(ii,i,lenn-1)G.a[ii]=0; 
		}
		G.res(sz);
		return G;
	}
	poly dln(poly A)
	{
		poly G=A;
		int sz=A.a.size();
		A=dinv(A);
		G.dao();
		A=A*G;
		A.jifen();
		A.res(sz);
		return A;
	}
	poly dexp(poly A)
	{	
		int x=1,sz=A.a.size();
		while(x<sz)x<<=1;
		poly s1,s;
		s1.res(1);
		s1.a[0]=1;
		for(int nw=2;nw<=x;nw<<=1)
		{
			s=s1;s.res(nw);
			s=dln(s);
			s=A-s;
			s.res(nw); 
			s.a[0]++;
			s1=s1*s;
		}
		s1.res(sz);
		return s1;
	}
	poly dsqrt(poly A)
	{
		int x=1;
		while(x<A.a.size())x<<=1;
		poly s1,s;A.res(x);
		s1.a.push_back(1);
		for(int nw=1;nw<=x;nw<<=1)
		{
			int lenn=nw<<1;
			s.res(nw);
			fo(i,0,nw-1)s.a[i]=A.a[i];
			s=s*dinv(s1);
			s1.res(lenn);
			fo(i,0,lenn-1)s1.a[i]=1ll*(s1.a[i]+s.a[i])*499122177%mo;
		}
		s1.res(A.a.size());
		return s1;
	}
	poly dpow(poly A,long long x,int x1)
	{
		int wz=0,szz=A.a.size();
		while(!A.a[wz])wz++;
		int nu=A.a[wz],inu=ksm(nu,mo-2);
		fo(i,wz,szz-1)A.a[i-wz]=1ll*A.a[i]*inu%mo;
		A.res(szz-wz);
		A=A.dln(A);
		fo(i,0,A.a.size()-1)A.a[i]=x%mo*A.a[i]%mo;
		A=A.dexp(A);
		nu=ksm(nu,x1);
		fo(i,0,A.a.size()-1)A.a[i]=1ll*A.a[i]*nu%mo;
		A.res(szz);
		if(1ll*wz*x>=szz)
		{
			A.res(szz);
			fo(i,0,szz-1)A.a[i]=0;
			return A; 
		}
		fd(i,szz,0)if(i+(wz)*x>=szz)continue;
		else A.a[i+wz*x]=A.a[i];
		fo(i,0,wz*x-1)A.a[i]=0;
		return A;
	}
	friend poly operator /(poly f,poly q)
	{
		int n=f.a.size()-1,m=q.a.size()-1;
		poly fr=f,qr=q;
		reverse(fr.a.begin(),fr.a.end());
		reverse(qr.a.begin(),qr.a.end());
		fr.res(n-m+1);qr.res(n-m+1);
		poly ret=fr*qr.dinv(qr);
		ret.res(n-m+1);
		reverse(ret.a.begin(),ret.a.end());
		return ret;
	}
	friend poly operator %(poly f,poly q)
	{
		if(f.a.size()<q.a.size())f.res(q.a.size());
		poly nu=f-f/q*q;
		nu.res(q.a.size()-1);
		return nu; 
	}
	void wri()
	{
		for(auto xx:a)write(xx);puts("");
	}
};
void preinv()
{
	ginv[0]=ginv[1]=jc[0]=1;
	fo(i,1,N-5)jc[i]=1ll*jc[i-1]*i%mo;
	inv[N-5]=ksm(jc[N-5],mo-2);
	fd(i,N-5,1)inv[i-1]=1ll*inv[i]*i%mo;
	fo(i,2,N-5)ginv[i]=1ll*ginv[mo%i]*(mo-mo/i)%mo;
	fo(i,1,22)yg[i]=ksm(3,(mo-1)>>i),iyg[i]=ksm(yg[i],mo-2);
}
#define k1 k<<1
#define k2 (k1)+1
poly nu[3000005];
int b[N];
void solve1(int l,int r,int k)
{
	if(l==r)return nu[k].a={mo-b[l],1},void();
	int mid=l+r>>1;
	solve1(l,mid,k1);solve1(mid+1,r,k2);
	nu[k]=nu[k1]*nu[k2];
}
void solve2(int l,int r,int k,poly nw)
{
	if(l==r)return nw.wri(),void();
	int mid=l+r>>1;
	solve2(l,mid,k1,nw%nu[k1]);
	solve2(mid+1,r,k2,nw%nu[k2]);
}
int main()
{
	preinv();
	int n=read()-1,m=read();
	poly a;
	fo(i,0,n)a.a.push_back(read());
	fo(i,1,m)b[i]=read();
	solve1(1,m,1);
	if(n>=m)a=a%nu[1];
	solve2(1,m,1,a);
	return 0;
}