N, K = map(int, input().split())
dp = [[0]*(N+1) for _ in range(K+1)]
dp[0][0] = 1
MOD = 998244353
invs = [pow(i, MOD-2, MOD) for i in range(N+10)]

for i in range(K):
    acc = 0
    
    for j in range(1, N+1):
        acc += dp[i][j-1]*invs[N-j+1]%MOD
        acc %= MOD
        dp[i+1][j] = acc

print(sum(dp[i][N] for i in range(K+1))%MOD)