Count the number of ways to tile the floor of size n x m using 1 x m size tiles
Submissions: 2826   Accuracy:

31.57%

  Difficulty: Easy   Marks: 2

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.

Input:

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.


Output:

For each test case output the answer in a new line. As the number can be really large output the answer modulo 109+7.


Constraints:

1<= T <=100

1<= N, M <=10000


Example:

Input:

2

2 3

4 4

Output:

1

2

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sujnesh Mishra
Author: sujnesh


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.