MOD = 998244353

max_n = 10**5
fact = [1] * (max_n + 1)
for i in range(1, max_n + 1):
    fact[i] = fact[i-1] * i % MOD

N, K = map(int, input().split())
m = N - K
if m < 0:
    print(0)
else:
    res = (K * fact[m]) % MOD
    print(res)