And

Two integers $N$ and $K$ are given. Your task is to find the number of sequences with $K$ terms. A sequence must satisfy the following conditions.

• $A_1 + A_2 + A_3 + \cdots + A_K = N$
• $A_{i+1} = A_i \, \& \, A_{i+1}$ (bitwise AND), $i = 1, 2, \ldots, K-1$

The first line gives a single positive integer $T$, the number of test cases. $(0 \le T \le 10)$

Each of the next $T$ lines gives two positive integers $K$ $(0 \le K \le 10^5)$ and $N$ $(0 \le N \le 10^4)$.

Print the answer for each test case on one line. The answer can be very large, so print it modulo $10^9+7$.