mod = 998244353

n,k = map(int,input().split())

#るいせきわ！

dp = [[0] * (k+1) for i in range(n+1)]

# 具体的には？
# dp[i][j] : i,jのときの確率
# dp[1][j] = 1
# dp[i][j] = pow(j, mod-2, mod) * sum(dp[k][j-1])

invm = [0] * (n+1)
for i in range(1, n+1):
	invm[i] = pow(i, mod-2, mod)

for i in range(k+1):
	dp[0][i] = 1

for j in range(1, k+1):
	rui = 0
	for i in range(1, n+1):
		rui += dp[i-1][j-1]
		rui %= mod
		dp[i][j] = rui * invm[i] % mod

#print(*dp)

print(dp[n][k])