There $a$ knives and $b$ forks. How many way of choosing $n$ pairs of knife and fork?
### Input
- A single line contains 3 integers $a, b, n$.
### Output
- Print the number of ways modulo $10^9+7$.
### Constraints
- $1 \le n \le a, b \le 10^3$.
### Example
Input:
```
9 6 4
```
Output:
```
1890
```
