Problem A:放苹果



Time Limit:1000MS Memory Limit:65536K

Total Submit:1094 Accepted:441



Language: not limited



Descr iption



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



Input



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



Output



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



Sample Input



1

7 3



Sample Output



8-Problem A: Apple released Time Limit: 1000MS Memory Limit: 65536KTotal Submit: 1094 Accepted: 441 Language: not limitedDescr iption to M of the same apple on the N plate of the same, allowing some empty onto a plate and asked the total number of different types of sub-law? (Indicated by K) 5,1,1 and 1,5,1 is the same method. Input the first line is the number of test data t (0