{"trustable":true,"sections":[{"title":"","value":{"format":"MD","content":"Sometimes it\u0027s quite useful to write pseudo codes forproblems. Actually you can write the necessary steps to solve a particularproblem. In this problem you are given a pseudo code to solve a problem and youhave to implement the pseudo code efficiently. Simple! Isn\u0027t it? :)\n\n\u003cdiv class\u003d\"haveborder\"\u003e\n\n```\npseudo code\n\n{\n\n take two integers n and m\n\n let p \u003d n ^ m (n to the power m)\n\n let sum \u003d summation of all the divisors of p\n\n let result \u003d sum MODULO 1000,000,007\n\n}\n```\n\n\u003c/div\u003e\n\nNow, given **n** and **m** you have to find the desiredresult from the pseudo code. For example if **n \u003d 12** and **m \u003d 2**.Then if we follow the pseudo code, we get:\n\n\u003cdiv class\u003d\"haveborder\"\u003e\n\n```\npseudo code\n\n{\n\n take two integers n and m\n\n so, n \u003d 12 and m \u003d 2\n\n let p \u003d n ^ m (n to the power m)\n\n so, p \u003d 144\n\n let sum \u003d summation of all the divisors of p\n\n so, sum \u003d 403, since the divisors of p are:\n\t {1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144}\n\n let result \u003d sum MODULO 1000,000,007\n\n so, result \u003d 403\n\n}\n```\n\n\u003c/div\u003e"}},{"title":"Input","value":{"format":"MD","content":"Input starts with an integer **T (\u0026#8804; 5000)**,denoting the number of test cases.\n\nEach test case will contain two integers, **n (1 \u0026#8804; n)**and **m (0 \u0026#8804; m)**. Each of **n** and **m** will be fit into a **32** bit signed integer."}},{"title":"Output","value":{"format":"MD","content":"For each case of input you have to print the case number andthe result according to the pseudo code."}},{"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\u003e3\n12 2\n12 1\n36 2\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: 403\nCase 2: 28\nCase 3: 3751\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}