MOD = 998244353
N, M = map(int, input().split())
L = 1001001
fact = [1] * L
fact_inv = [1] * L
for i in range(L - 1):
	fact[i + 1] = fact[i] * (i + 1) % MOD
fact_inv[L - 1] = pow(fact[L - 1], -1, MOD)
for i in range(L - 1, 0, -1):
	fact_inv[i - 1] = fact_inv[i] * i % MOD
M -= 1
ans = fact[N + M] * fact_inv[M] % MOD
for x in range(1, N + 1):
	n_ans = fact[N - x + M] * fact_inv[M] % MOD
	if x <= M:
		n_ans = n_ans * fact[N] % MOD
		n_ans = n_ans * fact_inv[N - x] % MOD
	else:
		n_ans = n_ans * fact[N - x + M] % MOD
		n_ans = n_ans * fact_inv[N - x] % MOD
		n_ans = n_ans * pow(N + M - x + 1, x - M, MOD) % MOD
	print((ans - n_ans) % MOD)
	ans = n_ans
print(ans)