local mod = 998244353
local mfl = math.floor
local function bmul(x, y)
  local x0, y0 = x % 31596, y % 31596
  local x1, y1 = mfl(x / 31596), mfl(y / 31596)
  return (x1 * y1 * 62863 + (x1 * y0 + x0 * y1) * 31596 + x0 * y0) % mod
end

local function badd(x, y)
  return (x + y) % mod
end

local function bsub(x, y)
  return x < y and x - y + mod or x - y
end

local function modpow(src, pow)
  local res = 1
  while 0 < pow do
    if pow % 2 == 1 then
      res = bmul(res, src)
      pow = pow - 1
    end
    src = bmul(src, src)
    pow = mfl(pow / 2)
  end
  return res
end

local function modinv(src)
  return modpow(src, mod - 2)
end

local fact = {1}
local invs = {1}
local invfact = {1}
for i = 2, 3000 do
  fact[i] = bmul(fact[i - 1], i)
  invs[i] = bmul(mfl(mod / i), mod - invs[mod % i])
  invfact[i] = bmul(invfact[i - 1], invs[i])
end

local function getComb(n, k)
  if k == 0 or k == n then return 1 end
  return bmul(fact[n], bmul(invfact[k], invfact[n - k]))
end

local n, k = io.read("*n", "*n")
local dp1, dp2 = {}, {}
for i = 1, n do
  dp1[i] = invs[i]
end
if k == 1 then
  print(dp1[n])
  os.exit()
end
for ik = 2, k do
  local src = ik % 2 == 0 and dp1 or dp2
  local dst = ik % 2 == 0 and dp2 or dp1
  local sum = 1
  for i = 1, n do
    dst[i] = bmul(invs[i], sum)
    sum = badd(sum, src[i])
  end
end
local tbl = k % 2 == 0 and dp2 or dp1
print(dp2[n])