import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

n,p = map(int,input().split())
all = 1
mod = 998244353
for i in range(1,n+1):
    all *= i
    all %= mod
e = 1
for i in range(1, p):
    e *= i
    e %= mod

# nCk
def com(n, mod):
    fact = [1, 1]
    factinv = [1, 1]
    inv = [0, 1]
    for i in range(2, n+1):
        fact.append((fact[-1]*i) % mod)
        inv.append((-inv[mod % i]*(mod//i)) % mod)
        factinv.append((factinv[-1]*inv[-1]) % mod)
    return fact, factinv

f,fi = com(n, mod)

def npr(n, r,):
    if n < r:return 1
    return f[n] * fi[n-r] % mod
def ncr(n, r):
    if n < r:return 1
    return f[n] * fi[n-r] % mod * fi[r] % mod
# 長さ1とpのループしかないとき

mx = n//p
now = 1
for i in range(mx+1):
    now *= ncr(p*i,p)
    now %= mod
    all -= ncr(n,n-p*i) * now * pow(e, i, mod)
    all %= mod


print(all)