The first line of input contains an integer 'T' representing the number of the test case. The first and the only line of each test case contains two space-separated integers ‘M’ and ‘N’, denoting the number of rows and number of columns of the matrix respectively.
For every test case, return a single integer, which is the total number of unique paths for traveling from top-left to bottom-right cells of the matrix. The output of each test case is printed in a separate line.
You don’t have to print anything, it has already been taken care of. Just implement the given function.
1 ≤ T ≤ 100 1 ≤ M ≤ 15 1 ≤ N ≤ 15 Where ‘M’ is the number of rows and ‘N’ is the number of columns in the matrix. Time limit: 1 sec
We can easily count the total number of paths by making a recursive algorithm.
The steps are as follows: