Problem Statement

There are $N$ squares arranged in a row, numbered $1$ to $N$ from left to right. Takahashi will stack building blocks on these squares, on which there are no blocks yet.

He wants to stack blocks on the squares evenly, so he will repeat the following operation until there are $H$ blocks on every square:

• Let $M$ and $m$ be the maximum and minimum numbers of blocks currently stacked on a square, respectively. Choose a square on which $m$ blocks are stacked (if there are multiple such squares, choose any one of them), and add a positive number of blocks on that square so that there will be at least $M$ and at most $M + D$ blocks on that square.

Tell him how many ways there are to have $H$ blocks on every square by repeating this operation. Since there can be extremely many ways, print the number modulo $10^9+7$.

Constraints

• $2 \\leq N \\leq 10^6$
• $1 \\leq D \\leq H \\leq 10^6$
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

$N$ $H$ $D$

Output

Print the number of ways to have $H$ blocks on every square, modulo $10^9+7$.

Sample Input 1

2 2 1

Sample Output 1

6

The possible transitions of (the number of blocks on Square $1$, the number of blocks on Square $2$) are as follows:

• $(0, 0)$ -> $(0, 1)$ -> $(1, 1)$ -> $(1, 2)$ -> $(2, 2)$

• $(0, 0)$ -> $(0, 1)$ -> $(1, 1)$ -> $(2, 1)$ -> $(2, 2)$

• $(0, 0)$ -> $(0, 1)$ -> $(2, 1)$ -> $(2, 2)$

• $(0, 0)$ -> $(1, 0)$ -> $(1, 1)$ -> $(1, 2)$ -> $(2, 2)$

• $(0, 0)$ -> $(1, 0)$ -> $(1, 1)$ -> $(2, 1)$ -> $(2, 2)$

• $(0, 0)$ -> $(1, 0)$ -> $(1, 2)$ -> $(2, 2)$

Thus, there are six ways to have two blocks on every square.

Sample Input 2

2 30 15

Sample Output 2

94182806

Sample Input 3

31415 9265 3589

Sample Output 3

312069529

Be sure to print the number modulo $10^9+7$.