The first line of the input contains integer T(1≤T≤100) -the number of the test casesFor each case: there will be one line, which contains three integers n,m,k(1≤n,m≤109 1≤k≤106, k≤n,m).
For each test case, you need print an integer means the number of ways of different coloring methods modulo 109+7.
2 3 2 2 3 2 1
2 0
In the first example we have two ways:
121
212
where 1 and 2 are two different color.
In the second example we can't do that.
扫描二维码，关注牛客网
下载牛客APP，随时随地刷题
扫一扫，把题目装进口袋
扫描二维码，进入QQ群
扫描二维码，关注牛客公众号
京公网安备
11010502036488号
