Problems > Modular Power

Modular Power

Difficulty: 1300 2000 ms 128 MB

math

Compute AB mod M.

Input: one line with three integers A, B, M.

Output: AB mod M.

Constraints:

  • 0 ≤ A ≤ 109
  • 0 ≤ B ≤ 1018
  • 2 ≤ M ≤ 109

Sample Tests

Input 1
2 10 1000
Output 1
24
Input 2
3 0 7
Output 2
1

Read the Editorial

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.