import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

def inv_arr(n):
    if n < 1: return []
    res = [-1, 1]
    for i in range(2, n+1):
        res.append(res[md%i]*(md-md//i)%md)
    return res

n, k = LI()
inv = inv_arr(n+1)

# dp[i][j]...jにいて、i回以内にゴールできる確率
dp = [[0]*(n+1) for _ in range(k+1)]
ss = [[0]*(n+2) for _ in range(k+1)]
for i in range(k+1):
    dp[i][0] = 1
    ss[i][1] = 1

for j in range(1, n+1):
    p = inv[j]
    for i in range(k+1):
        if i: dp[i][j] = ss[i-1][j]*p%md
        ss[i][j+1] = (ss[i][j]+dp[i][j])%md
# p2D(dp)
# p2D(ss)

print(dp[k][n])