from fractions import Fraction
def solve():
  MOD = 998244353
  n, k = (int(x) for x in input().split())
  good = Fraction(2*k, 2*k+1)
  ret = n * (good ** (2*k))
  print((ret.numerator * pow(ret.denominator, MOD-2, MOD))%MOD)

solve()