Score : 900 points
Snuke loves permutations. He is making a permutation of length N.
Since he hates the integer K, his permutation will satisfy the following:
Among the N! permutations of length N, how many satisfies this condition?
Since the answer may be extremely large, find the answer modulo 924844033(prime).
The input is given from Standard Input in the following format:
N K
Print the answer modulo 924844033.
3 1
2
2 permutations (1, 2, 3), (3, 2, 1) satisfy the condition.
4 1
5
5 permutations (1, 2, 3, 4), (1, 4, 3, 2), (3, 2, 1, 4), (3, 4, 1, 2), (4, 2, 3, 1) satisfy the condition.
4 2
9
4 3
14
425 48
756765083