Count the number of integer solutions to the following equation:
x1+x2+...+xk=n
with xi≥p.
### Input
- A single line contains 3 integers n,k,p.
### Output
- Print the number of solutions, modulo 109+7.
### Constraints
- 1≤n,k,p≤106.
### Example
Input:
831
Output:
21