# Arup Guha
# 10/12/2025
# Solution to 2025 NAQ Problem G: Mingle

import math

MOD = 998244353

# Get input.
toks = input().split()
n = int(toks[0])
k = int(toks[1])

'''
Solution idea:

For a particular spot, there are 2k+1 people who could
reach it. Each has a probability of 1/(2k+1) to get there.
The probability exactly 1 person gets there is:

C(2k+1,1)*(1/(2k+1))*((2k)/(2k+1))^(2k)

This is a binomial distribution. We choose 1 of the 2k+1
people to get there in C(2k+1,1) ways. That person has
probability of 1/(2k+1) of mapping there. The probability
the other 2k people map elsewhere is  ( (2k)/(2k+1) )^(2k),
the probability 1 person doesn't map there raised to the
power of 2k, the number of people we need not to map there.

You could simplify by canceling one copy of (2k+1) in the
numerator and denominator, but I didn't in my code.
'''

# First two terms in numerator.
num = n*(2*k+1)

# Complete the numerator.
num = (num*pow(2*k, 2*k, MOD))%MOD

# This is the denominator.
den = pow(2*k+1, 2*k+1, MOD)

# Get inverse.
mult = pow(den, MOD-2, MOD)

# Answer.
res = (num*mult)%MOD
print(res)