P5091 [Template] Extended Euler Theorem

The problem setter also wants to write an interesting statement, but unfortunately does not have the ability.

You are given three positive integers $a$, $m$, and $b$. You need to compute: $a^b \bmod m$.

One line with three integers, $a,m,b$.

Output one integer representing the answer.

Pay attention to the input format: $a,m,b$ represent the base, the modulus, and the exponent, in this order. [Sample $1$ Explanation] $2^4 \bmod 7 = 2$. [Constraints] For $100\%$ of the testdata, $1\le a \le 10^9$, $1\le b \le 10^{20000000}$, $1\le m \le 10^8$. Translated by ChatGPT 5