### Put Apples

Time Limit: 1000 ms
Memory Limit: 65536 KiB

#### Problem Description

There are M same apples,put them in N same plates,notice that allowing some empty plates;

Your mission is to calculate the total number of different classifications; (Indicated by K) ;

5,1,1 and 1,5,1 are the same classifications;

Your mission is to calculate the total number of different classifications; (Indicated by K) ;

5,1,1 and 1,5,1 are the same classifications;

#### Input

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

#### Output

Each of the input data M and N,output the number K.

#### Sample Input

1 7 3

#### Sample Output

8