Given a M X N matrix with your initial position at top-left cell, find the number of possible unique paths to reach the bottom right cell of the matrix from the initial position.
Note: Possible moves can be either down or right at any point in time, i.e., we can move to matrix[i+1][j] or matrix[i][j+1] from matrix[i][j].
The first line contains an integer T, depicting total number of test cases.
Then following T lines contains an two integers A and B depicting the size of the grid.
Print the number of unique paths to reach bottom-right cell from the top-left cell.
1 ≤ T ≤ 30
1 ≤ M ≤ 15
1 ≤ N ≤ 15