M = 2 * 10 ** 5 + 10
MOD = 998244353

f = [0 for _ in range(M)]
f_inv = [0 for _ in range(M)]
inv = [0 for _ in range(M)]

f[0], f[1] = 1, 1
f_inv[0], f_inv[1] = 1, 1
inv[1] = 1

for i in range(2, M):
    f[i] = (f[i-1] * i) % MOD
    inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
    f_inv[i] = f_inv[i-1] * inv[i] % MOD


def C(n, k):
    if n < k:
        return 0
    elif n < 0 or k < 0:
        return 0
    return f[n]*(f_inv[k]*f_inv[n-k] % MOD) % MOD

def main():
    N, P = map(int, input().split())
    
    ans = 0
    for k in range(0, N):
        if k * P > N:
            break

        ans += f[N] * pow(f[N - k * P], MOD-2, MOD) * pow(P, MOD-k-1, MOD) * pow(f[k], MOD-2, MOD)
        ans %= MOD
    
    print((MOD + f[N] - ans) % MOD)

main()