#include <bits/stdc++.h>
using namespace std;
constexpr int mod = 998244353, G = 3;
using poly = vector<int>;
constexpr int maxn = 1 << 18, N = (1 << 18) + 10;
int w[N], inv[N], lg[N], rev[N];
inline int add(int a, int b) {return (a += b - mod), a += a >> 31 & mod;}
inline int sub(int a, int b) {return (a -= b), a += a >> 31 & mod;}
inline int fpw(int a, int b) {
	int ans = 1;
	for(; b; b >>= 1, a = 1ll * a * a % mod) if(b & 1) ans = 1ll * ans * a % mod;
	return ans;
}
void init() {
	inv[1] = 1;
	for(int i = 2; i < N; i ++) lg[i] = lg[i + 1 >> 1] + 1;
	for(int i = 2; i < N; i ++) inv[i] = 1ll * inv[mod % i] * (mod - mod / i) % mod;
	int wn = fpw(G, (mod - 1) / maxn); w[0] = 1;
	for(int i = 1; i < N; i ++) w[i] = 1ll * wn * w[i - 1] % mod;
}
void dft(poly &a, int len) {
	for(int i = len >> 1; i >= 1; i >>= 1) {
		int s = maxn / (i << 1);
		for(int j = 0; j < len; j += i << 1) {
			for(int k = 0, *p = w; k < i; k ++, p += s) {
				int x = a[j + k], y = a[i + j + k];
				a[j + k] = add(x, y);
				a[i + j + k] = 1ll * *p * sub(x, y) % mod;
			}
		}
	}
}
void idft(poly &a, int len) {
	for(int i = 1; i < len; i <<= 1) {
		int s = maxn / (i << 1);
		for(int j = 0; j < len; j += i << 1) {
			for(int k = 0, *p = w; k < i; k ++, p += s) {
				int x = a[j + k], y = 1ll * *p * a[i + j + k] % mod;
				a[j + k] = add(x, y);
				a[i + j + k] = sub(x, y);
			}
		}
	}
	reverse(a.begin() + 1, a.end());
	for(int &x : a) x = 1ll * x * inv[len] % mod;
}
poly polymul(poly a, poly b, int len) {
	if(a.size() > len) a.resize(len);
	if(b.size() > len) b.resize(len);
	if(len <= 40) {
		poly c(len);
		for(int i = 0; i < a.size(); i ++) {
			for(int j = 0; j < min(len - i, int(b.size())); j ++) {
				c[i + j] = add(c[i + j], 1ll * a[i] * b[j] % mod);
			}
		}
		return c;
	}
	int mxlen = 1 << lg[a.size() + b.size() - 1];
	a.resize(mxlen), b.resize(mxlen);
	dft(a, mxlen), dft(b, mxlen);
	for(int i = 0; i < mxlen; i ++) a[i] = 1ll * a[i] * b[i] % mod;
	idft(a, mxlen), a.resize(len);
	return a;
}
poly polyinv(poly a, int len) {
	if(len == 1) return poly{fpw(a[0], mod - 2)};
	int mid = len + 1 >> 1, mxlen = 1 << lg[len * 2];
	poly f = polyinv(a, mid);
	f.resize(mxlen), a.resize(mxlen);
	dft(f, mxlen), dft(a, mxlen);
	for (int i = 0; i < mxlen; ++i) a[i] = (1ll * a[i] * f[i] - 1 + mod) % mod;
	for (int i = 0; i < mxlen; ++i) f[i] = 1ll * f[i] * (1 - a[i] + mod) % mod;
	idft(f, mxlen); f.resize(len);
	return f;
}
void qiudao(poly &a, int len) {
	for(int i = 0; i < len - 1; i ++) a[i] = 1ll * a[i + 1] * (i + 1) % mod;
}
void jifen(poly &a, int len) {
	for(int i = len - 1; i >= 1; i --) a[i] = 1ll * a[i - 1] * inv[i] % mod;
	a[0] = 0;
}
poly polydiv(poly a, poly b) {
	int n = a.size(), m = b.size();
	reverse(a.begin(), a.end()), reverse(b.begin(), b.end());
	b.resize(n - m + 1);
	poly p = polymul(a, polyinv(b, n - m + 1), n - m + 1);
	reverse(p.begin(), p.end());
	return p;
}
poly polymod(poly a, poly b) {
	int n = a.size(), m = b.size();
	if(n < m) return a;
	poly p = polydiv(a, b);
	poly q = polymul(b, p, m - 1);
	for(int i = 0; i < m - 1; i ++) q[i] = sub(a[i], q[i]);
	return q;
}
poly sum[N << 1];
int x[N], y[N];
#define ls u << 1 
#define rs u << 1 | 1
void dfs1(int u, int l, int r) {
	if(l == r) {
		sum[u] = {mod - x[l], 1};
	} else {
		int mid = l + r >> 1;
		dfs1(ls, l, mid), dfs1(rs, mid + 1, r);
		sum[u] = polymul(sum[ls], sum[rs], r - l + 2);
	}
}
void dfs2(int u, int l, int r, poly f) {
	f = polymod(f, sum[u]);
	if(l == r) {
		y[l] = f[0];
	} else {
		int mid = l + r >> 1;
		dfs2(ls, l, mid, f), dfs2(rs, mid + 1, r, f);
	}
}
#undef ls
#undef rs
int main() {
	// freopen("in.txt", "r", stdin);
	ios::sync_with_stdio(false), cin.tie(0);
	init();
	int n, m;
	cin >> n >> m;
	poly f(n), a(m);
	for(int &x : f) cin >> x;
	for(int i = 0; i < m; i ++) cin >> x[i]; 
	dfs1(1, 0, m - 1);
	dfs2(1, 0, m - 1, f);
	for(int i = 0; i < m; i ++) cout << y[i] << '\n';
	return 0;
}