{"trustable":true,"sections":[{"title":"","value":{"format":"MD","content":"As I am fond of creating easier problems, recently I discovered a new problem. Actually, the problem is \u0027how can you make **n** by adding **k** non-negative integers?\u0027 I think a small example will make things clear. Suppose **n\u003d4** and **k\u003d3**. There are **15** solutions. They are:\n\n\n\n| # | Combination | # | Combination | # | Combination |\n| -- |------------ | -- | ----------- | -- | ----------- |\n| 1 | 0 0 4 | 6 | 1 0 3 | 11 | 2 1 1 |\n| 2 | 0 1 3 | 7 | 1 1 2 | 12 | 2 2 0 |\n| 3 | 0 2 2 | 8 | 1 2 1 | 13 | 3 0 1 |\n| 4 | 0 3 1 | 9 | 1 3 0 | 14 | 3 1 0 |\n| 5 | 0 4 0 | 10 | 2 0 2 | 15 | 4 0 0 |\n\n\n\nAs I have already told you that I like to make problems easier, you don\u0027t have to find the actual result. You should report the result modulo **1000,000,007**."}},{"title":"Input","value":{"format":"MD","content":"Input starts with an integer **T (\u0026le; 25000)**, denoting the number of test cases.\n\nEach case contains two integer **n (0 \u0026le; n \u0026le; 10\u003csup\u003e6\u003c/sup\u003e)** and **k (1 \u0026le; k \u0026le; 10\u003csup\u003e6\u003c/sup\u003e)**."}},{"title":"Output","value":{"format":"MD","content":"For each case, print the case number and the result modulo **1000000007 (10\u003csup\u003e9\u003c/sup\u003e + 7, it\u0027s a prime)**."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e4\n4 3\n3 5\n1000 3\n1000 5\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: 15\nCase 2: 35\nCase 3: 501501\nCase 4: 84793457\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}