mod = 998244353

comb = [[0] * (i + 1) for i in range(101)]
comb[0][0] = 1
for i in range(1, 101):
	for j in range(i + 1):
		if j > 0: comb[i][j] += comb[i - 1][j - 1]
		if j < i: comb[i][j] += comb[i - 1][j]
		comb[i][j] %= mod

N, M = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if N > 100 or M > 100:
	exit(0)
g = [0] * (N + 1)
for i in range(M + 1):
	for j in range(N + 1):
		for k in range(j + 1):
			g[k] += B[i] * A[j] * comb[j][k] * pow(-i, j - k, mod) % mod
			g[k] %= mod
print(*g)