BETA

Difficulty Level:

Easy

Total Submissions: 3577 Accuracy:

21.89%

Count all possible paths from top left to bottom right
     

The task is to count all the possible paths from top left to bottom right of a mXn matrix with the constraints that from each cell you can either move only to right or down.

Input: 
First line consists of T test cases. First line of every test case consists of N and M, denoting the number of rows and number of column respectively.

Output: 
Single line output i.e count of all the possible paths from top left to bottom right of a mXn matrix. Since output can be very large number use %10^9+7.

Constraints:
1<=T<=100
1<=N<=100
1<=M<=100

Example:
Input:

1
3 3
Output:
6

**For More Examples Use Expected Output**

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

Contributor: Anuj Chauhan

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

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