描述：把M个同样的苹果放在N个同样的盘子里，允许有的盘子空着不放，问共有多少种不同的分法？（用K表示）5，1，1和1，5，1 是同一种分法。

输入：第一行是测试数据的数目t（0 <= t <= 20）。以下每行均包含二个整数M和N，以空格分开。1<=M，N<=10。

输出：对输入的每组数据M和N，用一行输出相应的K。

输入实例：

1

7 3

输出实例：8

-Descr iption: The same apples to the M of N on the same plate, empty plates to allow some hold, and asked how many different sub-law? (In K that) 5,1,1 and 1,5,1 is the same kind of points system. Input: The first line is the number of test data t (0 < = t < = 20). Each of the following line contains two integers M and N, separated by spaces. 1 < = M, N < = 10. Output: for each input data M and N, with a line of output corresponding K. Input Example: 173 Output Example: 8