Putting Apples

Problem Description

Put $m$ identical apples into $n$ identical plates, allowing some plates to be left empty. How many different ways are there? ($(5,1,1)$ and $(1,1,5)$ are considered the same way.)

Input Format

The first line is the number of test cases $t$, and each of the following lines contains two integers $m$ and $n$ separated by a space.

Output Format

For each test case $m$ and $n$ in the input, output the corresponding result on one line.

Sample Input

1
7 3

Sample Output

8

Sample Input 2

3
3 2
4 3
2 7

Sample Output 2

2
4
2

Hint

For all data, it is guaranteed that: $1 \le m, n \le 10$, $0 \le t \le 20$.