import math
from copy import deepcopy
N, K = map(int, input().split())
mod = 998244353
iv = pow(N, -1, mod)
dp = [0] * (N + 1)
dp[0] = 1
for _ in range(K) :
    dp2 = [0] * (N + 1)
    for i in range(N + 1) :
        p = (i * iv) % mod
        if i :
            dp2[i - 1] += dp[i] * p
            dp2[i - 1] %= mod
        if N - i :
            q = (1 - p + mod) % mod
            dp2[i + 1] += dp[i] * q
            dp2[i + 1] %= mod
    dp = deepcopy(dp2)
ans = N
for i in range(N + 1) :
    r = (K - i) // 2
    ans += dp[i] * r
    ans %= mod
print(ans)