Kevin calls a permutation perfect if the following conditions holds:
Kevin is interested in how many perfect permutations exist. As this number can be very big output it modulo 1000000007(109+7).
Input format:
The first line of input will contain an integer T, denoting the number of test cases.
Each of the next T lines contain two integers N and K.
Output format:
For every test case output the number of perfect permutations modulo 109+7.
Constraints:
In the first case perfect permutations are (1,4,2,3) , (1,3,4,2) , (2,1,4,3) , (3,1,2,4) and (2,3,1,4).