{"trustable":true,"sections":[{"title":"Description","value":{"format":"MD","content":"You are given three integers $a,b,p$, find $a^b \\bmod p$."}},{"title":"Input","value":{"format":"MD","content":"There is only one line of input containing three integers representing $a,b,p$."}},{"title":"Output","value":{"format":"MD","content":"Output a single line containing a string `a^b mod p\u003ds`, where $a,b,p$ are the given values of the problem, and $s$ is the result of the operation."}},{"title":"Sample 1","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\u003e2 10 9\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2^10 mod 9\u003d7\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e"}},{"title":"Hint","value":{"format":"MD","content":"**Explanation for the Sample**\n\n$2^{10} \u003d 1024$, $1024 \\bmod 9 \u003d 7$.\n\n**Constraints**\n\nFor the input of $100\\%$, it is guaranteed that $0\\le a,b \u003c 2^{31}$, $a+b\u003e0$, $2 \\leq p \\lt 2^{31}$."}}]}