Binomial Coefficient Modulo (1)

Problem Description

Answer $T$ test cases. For each case, output the value of ${n \choose m} \bmod {10^9+7}$.

Input Format

The first line contains an integer $T$, the number of test cases.

For each test case, a line contains two integers $n, m$.

Output Format

For each test case, output one line containing the answer.

Sample Input

3
5 2
50 20
500 200

Sample Output

10
211914057
395607423

Constraints

For all data, $1\leq T\leq 10^5$ and $1\leq m\leq n\leq 10^7$ are guaranteed.