{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp class\u003d\"MsoNormal\"\u003eAs I am fond of making easier problems, I discovered a problem. Actually, the problem is \u0027how can you make \u003cb\u003en\u003c/b\u003e by adding \u003cb\u003ek\u003c/b\u003e non-negative integers?\u0027 I think a small example will make things clear. Suppose \u003cb\u003en\u003d4\u003c/b\u003e and \u003cb\u003ek\u003d3\u003c/b\u003e. There are \u003cb\u003e15\u003c/b\u003e solutions. They are\u003c/p\u003e \n\u003cpre\u003e1. 0 0 4\n2. 0 1 3\n3. 0 2 2\n4. 0 3 1\n5. 0 4 0\n6. 1 0 3\n7. 1 1 2\n8. 1 2 1\n9. 1 3 0\n10. 2 0 2\n11. 2 1 1\n12. 2 2 0\n13. 3 0 1\n14. 3 1 0\n15. 4 0 0\u003c/pre\u003e\n \u003cp class\u003d\"MsoNormal\"\u003eAs I have already told you that I use to make problems easier, so, you don\u0027t have to find the actual result. You should report the result modulo \u003cb\u003e1000,000,007\u003c/b\u003e.\u003c/p\u003e \n "}},{"title":"Input","value":{"format":"HTML","content":" \n \u003cp class\u003d\"MsoNormal\"\u003eInput starts with an integer \u003cb\u003eT (\u003c/b\u003e\u003cb\u003e≤ 25000)\u003c/b\u003e, denoting the number of test cases.\u003c/p\u003e \n \u003cp class\u003d\"MsoNormal\"\u003eEach case contains two integer \u003cb\u003en (0 ≤ n ≤ 10\u003csup\u003e6\u003c/sup\u003e)\u003c/b\u003e and \u003cb\u003ek (1 ≤ k ≤ 10\u003csup\u003e6\u003c/sup\u003e)\u003c/b\u003e.\u003c/p\u003e \n "}},{"title":"Output","value":{"format":"HTML","content":" \n \u003cp class\u003d\"MsoNormal\"\u003eFor each case, print the case number and the result modulo \u003cb\u003e1000000007\u003c/b\u003e.\u003c/p\u003e \n "}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e4\n4 3\n3 5\n1000 3\n1000 5\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003eCase 1: 15\nCase 2: 35\nCase 3: 501501\nCase 4: 84793457\u003c/pre\u003e"}}]}