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 109+7.
### Constraints
- 1≤n≤a,b≤103.
### Example
Input:
964
Output:
1890