import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N, K = map(int, input().split())
mod = 998_244_353

pinv = [pow(i, mod - 2, mod) for i in range(N + 1)]

dp = [[0 for _ in range(N + 1)] for _ in range(K + 1)]
dp[0][0] = 1
for i in range(K):
    for j in range(N):
        dp[i + 1][j + 1] += dp[i][j] * pinv[N - j]
        dp[i + 1][j + 1] %= mod
    for j in range(N):
        dp[i + 1][j + 1] += dp[i + 1][j]
        dp[i + 1][j + 1] %= mod

ans = 0
for i in range(K + 1):
    ans += dp[i][N]
    ans %= mod
print(ans)