Modular exponentiation

Write a program that, given n, k and m, computes n^(k) mod  m.

Input

Input consists of several cases, each one with three natural numbers n,
k and m. Assume 2 ≤ n ≤ 30000 and 2 ≤ m ≤ 30000.

Output

For every case, print n^(k) mod  m.

Problem information

Author: Unknown
Translator: Salvador Roura

Generation: 2026-01-25T10:37:39.476Z

© Jutge.org, 2006–2026.
https://jutge.org
