Problem Description

Place $m$ identical apples into $n$ identical plates, allowing some plates to be empty. Determine the number of distinct ways to do this. Note that arrangements like $5,1,1$ and $1,1,5$ are considered the same method.

Input Format

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

Output Format

For each pair of input data $m$ and $n$, output the corresponding result on a single line.

Sample Input and Output

Sample Input #1

1
7 3

Sample Output #1

8

Sample Input #2

3
3 2
4 3
2 7

Sample Output #2

2
4
2

Notes

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

见题面 Input 部分

见题面 Output 部分