1893：Wand

N wizards are attending a meeting. Everyone has his own magic wand.

N magic wands was put in a line, numbered from 1 to n (Wand_i owned by wizard_i).

After the meeting, n wizards will take a wand one by one in the order of 1 to n. A boring wizard decided to reorder the wands.

He is wondering how many ways to reorder the wands so that at least k wizards can get his own wand.

For example, n=3. Initially, the wands are w1 w2 w3. After reordering, the wands become w2 w1 w3.

So, wizard 1 will take w2, wizard 2 will take w1, wizard 3 will take w3, only wizard 3 get his own wand.

First line contains an integer T (1 ≤ T ≤ 10), represents there are T test cases.

For each test case: Two number n and k.（1 ≤ n ≤ 10000. 1 ≤ k ≤ 100. k ≤ n.）

For each test case, output the answer mod 1000000007 (10⁹ + 7).

2

1 1

3 1

1

4