#include <bits/stdc++.h>
#define LL long long
using namespace std;

int read() {
	int s = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
		f = (ch == '-' ? -1 : 1), ch = getchar();
	while (ch >= '0' && ch <= '9')
		s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
	return s * f;
}

const int mod = 998244353;

int qpow(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1)
			res = (LL)res * a % mod;
		a = (LL)a * a % mod, b >>= 1;
	}
	return res;
}

auto fplus = [](int x, int y) {return x + y < mod ? x + y : x + y - mod;};
auto fminus = [](int x, int y) {return x >= y ? x - y : x + mod - y;};
auto Fplus = [](int &x, int y) {x = fplus(x, y);};
auto Fminus = [](int &x, int y) {x = fminus(x, y);};

namespace Poly {
	#define poly vector<int>
	const int g = 3;
	inline void upd(int &a) { a += a >> 31 & mod; }
	poly rev, W[25];
	int getlen(int x) {
		int N = 1, pw = 0;
		while (N < x)
			N <<= 1, pw++;
		rev.resize(N);
		for (int i = 0; i < N; i++)
			rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (pw - 1));
		return N;
	}
	void NTT(poly &a, int tp) {
		int n = a.size();
		for (int i = 0; i < n; i++)
			if (i < rev[i])
				swap(a[i], a[rev[i]]);
		for (int j = 1, c = 0; j < n; j <<= 1, c++) {
			poly w(j);
			for (int i = 0; i < j; i++)
				w[i] = W[c][i];
			for (int i = 0; i < n; i += (j << 1))
				for (int k = 0; k < j; k++) {
					const int y = 1ll * a[i | k | j] * w[k] % mod;
					upd(a[i | k | j] = a[i | k] - y);
					upd(a[i | k] += y - mod);
				}
		}
		if (tp == -1) {
			reverse(a.begin() + 1, a.begin() + n);
			int invn = qpow(n, mod - 2);
			for (int i = 0; i < n; i++)
				a[i] = (LL)a[i] * invn % mod;
		}
	}
	poly mul(poly a, poly b) {
		int n = a.size(), m = b.size(), len = getlen(n + m - 1);
		a.resize(len), b.resize(len), NTT(a, 1), NTT(b, 1);
		for (int i = 0; i < len; i++)
			a[i] = (LL)a[i] * b[i] % mod;
		NTT(a, -1), a.resize(n + m - 1);
		return a;
	}
	void init() {
		int n = (1 << 18);
		for (int j = 1, pw = 0; j < n; j <<= 1, pw++) {
			int ur = qpow(g, (mod - 1) / (j << 1));
			W[pw].resize(j), W[pw][0] = 1;
			for (int i = 1; i < j; i++)
				W[pw][i] = (LL)W[pw][i - 1] * ur % mod;
		}
	}
	poly MOD(poly f, int n) {
		f.resize(n);
		return f;
	}
	poly inv(poly f) {
		int n = f.size();
		if (n == 1)
			return {qpow(f[0], mod - 2)};
		poly tmp = MOD(f, (n + 1) >> 1), h = inv(tmp);
		int N = getlen(n * 2 - 1);
		h.resize(N), f.resize(N);
		NTT(f, 1), NTT(h, 1);
		poly g(N);
		for (int i = 0; i < N; i++)
			g[i] = fminus(fplus(h[i], h[i]), (LL)f[i] * h[i] % mod * h[i] % mod);
		NTT(g, -1), g.resize(n);
		return g;
	}
	poly minus(poly a, poly b) {
		if (a.size() < b.size())
			a.resize(b.size());
		for (int i = 0; i < (int)b.size(); i++)
			Fminus(a[i], b[i]);
		return a;
	}
	void DIV(poly f, poly g, poly &q, poly &r) {
		int n = f.size(), m = g.size();
		if (n < m) {
			q = {0}, r = f;
			return ;
		}
		poly ff = f, gg = g;
		reverse(gg.begin(), gg.end()), reverse(ff.begin(), ff.end());
		if ((int)gg.size() < n - m + 1)
			gg.resize(n - m + 1);
		gg = inv(gg);
		q = mul(gg, ff), q.resize(n - m + 1), reverse(q.begin(), q.end());
		r = minus(f, mul(g, q)), r.resize(m - 1);
	}
	poly MOD(poly f, poly g) {
		poly q, r;
		DIV(f, g, q, r);
		return r;
	}
}

const int MAXN = 64005;

poly P[MAXN << 2];

#define ls (p << 1)
#define rs (p << 1 | 1)
#define mid ((l + r) >> 1)

void build(int l, int r, int p, poly &a) {
	if (l == r) {
		P[p] = {fminus(0, a[l]), 1};
		return ;
	}
	build(l, mid, ls, a), build(mid + 1, r, rs, a);
	P[p] = Poly::mul(P[ls], P[rs]);
}

void calc(int l, int r, int p, poly A, poly &ans, poly &a) {
	A = Poly::MOD(A, P[p]);
	if (r - l <= 200) {
		for (int i = l; i <= r; i++)
			for (int j = 0, pw = 1; j < (int)A.size(); j++, pw = 1ll * pw * a[i] % mod)
				Fplus(ans[i], 1ll * pw * A[j] % mod);
		return ;
	}
	calc(l, mid, ls, A, ans, a), calc(mid + 1, r, rs, A, ans, a);
}

poly calc(poly f, poly a) {
	int m = a.size();
	poly ans(m);
	build(0, m - 1, 1, a);
	calc(0, m - 1, 1, f, ans, a);
	return ans;
}

signed main() {
	Poly::init();
	int n = read() + 1, m = read();
	poly f(n), a(m);
	for (int i = 0; i < n; i++)
		f[i] = read();
	for (int i = 0; i < m; i++)
		a[i] = read();
	poly ans = calc(f, a);
	for (int i = 0; i < m; i++)
		printf("%d\n", ans[i]);
	cerr << 1.0 * clock() / CLOCKS_PER_SEC << endl;
	return 0;
}