Problem C: Putting apples

Problem C: Putting apples

Time Limit: 1 Sec  Memory Limit: 64 MB
Submit: 10  Solved: 2
[Submit] [Status] [Web Board] [Creator:]

Description

Put M identical apples on N identical plates, allow some plates to be left empty. how many different methods are there? (indicated by K).

Notice that 5,1,1 and 1,5,1 are the same method.

Input

The first line is the number t of test data (0 <= t <= 20). Each of the following t lines contains two integers M and N separated by space. 1<=M, N<=10.


Output

For each set of data M and N entered, output the corresponding K in one line.

Sample Input Copy

1
7 3

Sample Output Copy


8