MOD = 998244353
N,K = map(int,input().split())
dp = [[0 for _ in range(N+1)] for _ in range(2)]
dp[1][1] = 1
invN = pow(N,MOD-2,MOD)
for i in range(2,K+1):
    for j in range(N+1):
        dp[i%2][j] = 0
        if j>=1:
            dp[i%2][j] = (dp[i%2][j]+dp[(i-1)%2][j-1]*(N-j+1)*invN)%MOD
        if j<N:
            dp[i%2][j] = (dp[i%2][j]+dp[(i-1)%2][j+1]*(j+1)*invN)%MOD
ans = 0
inv2 = pow(2,MOD-2,MOD)
for j in range(N+1):
    if (K-j)%2==0:
        ans = (ans+dp[K%2][j]*(K-j)*inv2)%MOD
print((N+ans)%MOD)