{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"Given a code (not optimized and might have overflow problems), and necessary inputs, you have to find the output of the code. The code is as follows:\n\n"}},{"title":"","value":{"format":"MD","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eCode\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e\nint a, b, c, d, e, f;\nint fn(int n) {\n if (n \u003d\u003d 0) return a;\n if (n \u003d\u003d 1) return b;\n if (n \u003d\u003d 2) return c;\n if (n \u003d\u003d 3) return d;\n if (n \u003d\u003d 4) return e;\n if (n \u003d\u003d 5) return f;\n return fn(n-1) + fn(n-2) + fn(n-3) + fn(n-4) + fn(n-5) + fn(n-6);\n}\nint main() {\n int n, cases;\n scanf(\"%d\", \u0026cases);\n for (int caseno \u003d 1; caseno \u003c\u003d cases; ++caseno) {\n scanf(\"%d %d %d %d %d %d %d\", \u0026a, \u0026b, \u0026c, \u0026d, \u0026e, \u0026f, \u0026n);\n printf(\"Case %d: %d\\n\", caseno, fn(n) % 10000007);\n }\n return 0;\n}\n\u003c/pre\u003e\u003c/td\u003e\n \n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Input","value":{"format":"MD","content":"Input starts with an integer **T (≤ 100)**, denoting the number of test cases.\n\nEach case contains seven integers **a, b, c, d, e, f** and **n**. All integers will be non-negative and **0 ≤ n ≤ 10000** and others will fit into 32-bit integers."}},{"title":"Output","value":{"format":"MD","content":"For each case, print the output of the given code. The given code may have integer overflow problem in the compiler, so be careful."}},{"title":"Sample","value":{"format":"MD","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\u003e6\n0 1 2 3 4 5 20\n1 2 3 4 5 6 10000\n3 2 1 5 0 1 9\n4 12 9 4 5 6 15\n9 8 7 6 5 4 3\n3 4 3 2 54 5 4\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: 216339\nCase 2: 5333347\nCase 3: 79\nCase 4: 16636\nCase 5: 6\nCase 6: 54\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}