B'Gaurang has grown up in a mystical universe. He is faced by n consecutive 2D planes. He shoots a particle of decay age k at the planes. A particle can pass through a plane directly, however, every plane produces an identical copy of the particle going in the opposite direction with a decay age k-1 . If a particle has decay age equal to 1 , it will NOT produce a copy. For example, if there are two planes and a particle is shot with decay age 3 (towards the right), the process is as follows: (here, D(x) refers to a single particle with decay age x ) In total, the final multiset S of particles is {D(3), D(2), D(2), D(1) } . (See notes for visual explanation of this test case.) Gaurang is unable to cope up with the complexity of this situation when the number of planes is too large. Help Gaurang find the size of the multiset S , given n and k . Since the size of the multiset can be very large, you have to output it modulo 10^9+7 . Note: Particles can go back and forth between the planes without colliding with each other. The first line of the input contains the number of test cases t ( 1 <= t <= 100 ). Then, t lines follow, each containing two integers n and k ( 1 <= n, k <= 1000 ). Additionally, the sum of n over all test cases will not exceed 1000 , and the sum of k over all test cases will not exceed 1000 . All test cases in one test are different. Output t integers. The i -th of them should be equal to the answer to the i -th test case. Let us explain the first example with four test cases. Test case 1: ( n = 2 , k = 3 ) is already explained in the problem statement. See the below figure of this simulation. Each straight line with a different color represents the path of a different particle. As you can see, there are four distinct particles in the multiset. Note that the vertical spacing between refl'...