Chocolate selling

Coco is running a chocolate factory. Chocolates from this factory are rectangles of width $N$ and height $3$. Coco wants to divide the chocolate into $\lfloor \frac{3N}{2} \rfloor$ domino pieces ($1 \times 2$ or $2 \times 1$) and sell them. Somehow $N$ is always odd, so Coco decided to take away a $1 \times 1$ piece of his liking, and divide the rest.

Given $N$ and the position of the $1 \times 1$ piece, calculate the number of ways Coco can divide the rest of the chocolate into domino pieces.

The first line of input contains $T$, the number of test cases. ($1 \le T \le 10^5$)

For each test case, the integers $N$, $R$, and are given on one line, separated by spaces. and indicate that the piece chosen is at row and column . (, , )

For each test case, output the answer modulo $10^9+7$ on its own line.