## https://yukicoder.me/problems/no/554

MOD = 998244353


def main():
    N, K = map(int, input().split())

    inv_n = pow(N, MOD - 2, MOD)
    dp = [0] * (N + 1)
    dp[0] = 1

    for _ in range(K):
        new_dp = [0] * (N + 1)

        for n in range(N):
            p = ((N - n) * inv_n) % MOD
            new_dp[n + 1] += (dp[n] * p) % MOD
            new_dp[n + 1] %= MOD

        for n in range(1, N + 1):
            p = (n * inv_n) % MOD
            new_dp[n - 1] += (dp[n] * p) % MOD
            new_dp[n - 1] %= MOD
        dp = new_dp

    answer = 0
    for n1 in range(N + 1):
        if (K - n1) % 2 == 0:
            n2 = (K - n1) // 2
            val = N + n2

            answer += (val * dp[n1]) % MOD
            answer %= MOD
    print(answer)
 


        






if __name__ == "__main__":
    main()