21084번 - Multiple? 다국어

문제

Given an integer $n,ドル the sequence is called good if its elements are from $[1, n]$ and all its non-empty subsequences (not necessarily continuous) have sums not divisible by $n$.

Calculate the number of good sequences of length $n-k$ modulo 998ドル,244円,353円$.

입력

The only line of input contains two integers $n$ and $k$ (1ドル \le k \le n/4 < n < 998,244円,353円$).

출력

Print one number --- the answer to the problem.

제한

힌트