Given two integers n and k, count the number of binary strings of length n with k as number of times adjacent 1’s appear.
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 the two integers N and K.
Print the answer for each testcase in a new line. Since the answer can be quiet large output the answer modulo 109+7.
1<= N, K <=1000
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.