Given a floor of size n x m and tiles of size 1 x m. The problem is to count the number of ways to tile the given floor using 1 x m tiles. A tile can either be placed horizontally or vertically.
Both n and m are positive integers and 2 < = m.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains two integers M and N.
For each test case output the answer in a new line. As the number can be really large output the answer modulo 109+7.
1<= T <=100
1<= N, M <=10000