MOD = 998244353
n, k = map(int, input().split())
d = [[0] * (n + 1) for _ in range(k + 1)]
d[0][n] = 1
v = [0] * (n + 1)
for i in range(1, n + 1):
    v[i] = pow(i, MOD - 2, MOD)
for i in range(k):
    t = 1
    for j in range(n - 1, -1, -1):
        d[i + 1][j] = t * v[n - j] % MOD
        t += d[i][j]
print(d[k][0])