mod = 998244353
max_n = 10**5  # Maximum possible value for N is 1e5

# Precompute factorials modulo 998244353 up to max_n
fact = [1] * (max_n + 1)
for i in range(1, max_n + 1):
    fact[i] = fact[i-1] * i % mod

# Read input
n, k = map(int, input().split())
x = n - k
ans = k * fact[x] % mod
print(ans)