2018 Asia Singapore Preliminary Contest

Start

2018-09-14 18:00 AKDT

2018 Asia Singapore Preliminary Contest

End

2018-09-14 23:00 AKDT
The end is near!
Contest is over.
Not yet started.
Contest is starting in -1100 days 7:09:09

5:00:00

0:00:00

Problem IClassical Counting

You have $N$ objects, each with $M$ copies. How many ways are there to take exactly $K$ of them?

Input

The first line of input contains three integers, $N$, $M$ and $K$ respectively, subjected to $1 \leq N, M, K \leq 10^5$.

Output

Output the number of ways. As the number of ways could be large, output them modulo $10^6 + 7$.

Sample Input 1 Sample Output 1
10 1 2

45

Sample Input 2 Sample Output 2
3 3 3

10

Sample Input 3 Sample Output 3
3 2 7

0