#include<cstdio>
#include<algorithm>
#include<vector>
#define fo(i,x,y) for(int i = x;i <= y;++i)
#define fd(i,x,y) for(int i = x;i >= y;--i)
#define _is 1048576 * 20
#define _os 1048576 * 10
#define gc() ib[++bi]
#define pc(ch) ob[++bo] = ch
using namespace std;
char ib[_is],ob[_os];int bi = -1,bo = -1;
int rd()
{
	int x = 0;char ch = gc();
	while(ch < 48 || ch > 57) ch = gc();
	while(ch >= 48 && ch <= 57) x = x * 10 + ch - 48,ch = gc();
	return x;
}
void pr(int x)
{
	char ch[20];int w = -1;
	if(x == 0) ch[++w] = 48;
	while(x) ch[++w] = x % 10 + 48,x /= 10;
	fd(i,w,0) pc(ch[i]);pc('\n');
}
namespace Polyint
{
	#define sz(x) int(x.size())
	#define add(x,y) (x >= p - y ? x + y - p : x + y)
	#define sub(x,y) (x < y ? x - y + p : x - y)
	#define p 998244353
	
	int max(int x,int y) {return y < x ? x : y;}
	inline int ksm(int x,int y) {int res = 1;for(;y;y >>= 1,x = 1ll * x * x % p) if(y & 1) res = 1ll * res * x % p;return res;}
	vector<int> w;
	int pN = 0;
	void pre(int N,int lg)
	{
		w.resize((N >> 1) + 1);
		w[0] = 1,w[1ll << (lg - 1)] = ksm(3,(p - 1) >> (lg + 1));
		fd(i,lg - 1,1) w[1ll << (i - 1)] = 1ll * w[1ll << i] * w[1ll << i] % p;
		fo(i,1,1 << (lg - 1)) w[i] = 1ll * w[i & i - 1] * w[i & -i] % p;
	}
	struct poly
	{
		vector<int> a;

		poly() {}
		poly(int sz) {a.resize(sz);}
		poly(vector<int> b) {a = b;}
		poly(int *itl,int *itr) {a = vector<int>(itl,itr);}
		poly(poly &b) {a = b.a;}

		int &operator [](int x) {return a[x];}
		void resize(int x) {a.resize(x);}
		int at(int x) {return x >= sz(a) ? 0 : a[x];}
		void clear() {a.clear(),a.shrink_to_fit();}
		int size() {return a.size();}

		void DIF()
		{
			int N = sz(a);
			for(int l = N >> 1;l;l >>= 1) for(int i = 0,k = 0;i < N;i += l << 1,++k) fo(j,0,l - 1)
			{
				int x = a[i + j],y = 1ll * a[i + j + l] * w[k] % p;
				a[i + j] = add(x,y),a[i + j + l] = sub(x,y);
			}
		}
		void DIT()
		{
			int N = sz(a);
			for(int l = 1;l < N;l <<= 1) for(int i = 0,k = 0;i < N;i += (l << 1),++k) fo(j,0,l - 1)
			{
				int x = a[i + j],y = a[i + j + l];
				a[i + j] = add(x,y),a[i + j + l] = 1ll * sub(x,y) * w[k] % p;
			}
			fo(i,1,(N - 1) >> 1) a[i] ^= a[N - i] ^= a[i] ^= a[N - i];
            int ny = ksm(N,p - 2);
			fo(i,0,N - 1) a[i] = 1ll * a[i] * ny % p;
		}
		void plus(poly &b)
		{
			resize(max(sz(a),sz(b.a)));
			fo(i,0,sz(a) - 1) a[i] = add(a[i],b.at(i));
		}
		void minus(poly &b)
		{
			resize(max(sz(a),sz(b.a)));
			fo(i,0,sz(a) - 1) a[i] = sub(a[i],b.at(i));
		}
		void mul(poly &b)
		{
			poly c(b);
			int N = 1,lg = 0,n = sz(a) + sz(b);
			if(sz(a) <= 50 || sz(c) <= 50)
			{
				poly d(*this);clear(),resize(n - 1);
				fo(i,0,sz(d) - 1)
				{
					if(d.a[i] == 0) continue;
					fo(j,0,sz(c) - 1) a[i + j] = (a[i + j] + 1ll * d[i] * c[j]) % p;
				}
			}
			else
			{
				while(N < n) N <<= 1,++lg;
				if(N > pN) pre(N,lg),pN = N;
				resize(N),c.resize(N),DIF(),c.DIF();
				fo(i,0,N - 1) a[i] = 1ll * a[i] * c[i] % p;
				DIT();
			}
			a.resize(n - 1);
		}
		void inv()
		{
			poly res,f,g;res.resize(1),res[0] = ksm(a[0],p - 2);
			for(int i = 1,lg = 0;i < sz(a);i <<= 1,++lg)
			{
				f = res,f.resize(i << 1),g.resize(i << 1),res.resize(i << 1);
				if((i << 1) > pN) pre(i << 1,lg + 1),pN = i << 1;
				fo(j,0,(i << 1) - 1) g[j] = (*this).at(j);
				f.DIF(),g.DIF();
				fo(j,0,(i << 1) - 1) g[j] = 1ll * g[j] * f[j] % p;
				g.DIT();
				fo(j,0,i - 1) g[j] = 0;
				g.DIF();
				fo(j,0,(i << 1) - 1) g[j] = 1ll * g[j] * f[j] % p;
				g.DIT();
				fo(j,i,(i << 1) - 1) res[j] = (p - g[j]) % p;
			}
			res.resize(sz(a)),(*this) = res;
		}
	};
}
using Polyint::poly;
int n,m;
poly g[4050010];
void getg(int x,int l,int r,const vector<int> &b)
{
	if(l == r)
	{
		if(l >= b.size()) g[x].resize(1),g[x][0] = 1;
		else g[x].resize(2),g[x][0] = (p - b[l]) % p,g[x][1] = 1;
		return;
	}
	int m = (l + r) >> 1;
	getg(x << 1,l,m,b),getg(x << 1 | 1,m + 1,r,b);
	g[x] = g[x << 1],g[x].mul(g[x << 1 | 1]);
}
void Getv(poly &a,int x,int l,int r,int bm,vector<int> &ans)
{
	if(l == r) {ans[l] = a[0];return;}
	int m = (l + r) >> 1;
	poly ta(a);
	ta.mul(g[x << 1 | 1]);
	fo(i,0,sz(ta) - sz(g[x << 1 | 1])) ta[i] = ta[i + sz(g[x << 1 | 1]) - 1];
	ta.resize(sz(g[x << 1])),Getv(ta,x << 1,l,m,bm,ans);
	if(m + 1 < bm)
	{
		ta = a,ta.mul(g[x << 1]);
		fo(i,0,sz(ta) - sz(g[x << 1])) ta[i] = ta[i + sz(g[x << 1]) - 1];
		ta.resize(sz(g[x << 1 | 1])),Getv(ta,x << 1 | 1,m + 1,r,bm,ans);
	}
}
vector<int> getv(poly a,const vector<int> &b)
{
	int n = max(a.size(),int(b.size()));
	getg(1,0,n - 1,b);
	poly ig = g[1];reverse(ig.a.begin(),ig.a.end()),ig.resize(n),ig.inv(),reverse(ig.a.begin(),ig.a.end());
	a.resize(n),a.mul(ig);
	fo(i,0,n - 1) a[i] = a[i + n - 1];a.resize(n);
	vector<int> ans(m);
	return Getv(a,1,0,n - 1,sz(b),ans),ans;
}
int main()
{
	fread(ib,1,_is,stdin);
	n = rd(),m = rd();
	poly a(n + 1);
	fo(i,0,n) a[i] = rd();
	vector<int> b(m);
	fo(i,0,m - 1) b[i] = rd();
	vector<int> v = getv(a,b);
	fo(i,0,m - 1) pr(v[i]);
	fwrite(ob,1,bo + 1,stdout);
}