Putting Apples

Problem Background

Special for beginners, ^_^

Problem Description

Put $M$ identical apples into $N$ identical plates, where some plates may be left empty. How many different ways of distribution are there (denoted by $K$)? Note that $5,1,1$ and $1,5,1$ are considered the same distribution.

Input Format

The first line is the number of test cases $t$ ($0 \le t \le 20$). Each of the following $t$ lines contains two integers $M$ and $N$, separated by a space ($1 \le M, N \le 10$).

Output Format

For each input case with $M$ and $N$, output the corresponding $K$ on a single line.

Sample Input

1
7 3

Sample Output

8

Constraints

1s, 1024KiB for each test case.