Binomial Coefficient Modulo 2

Problem Description

Answer $T$ queries; for each query output the value of ${n \choose m} \bmod (10^9 + 7)$.

Input Format

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

For each query, one line contains two integers $n, m$.

Output Format

For each query, output one line: 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$, $1 \leq m \leq n \leq 10^9$.