e-olymp
favorite We need a little bit of your help to keep things running, click on this banner to learn more
Problems

A^B mod C

A^B mod C

Given a, b, c find the value of ab mod c (1a, b, c < 263).

Input

Contains multiple test cases. Each test is given in one line and contains three integers a, b and c.

Output

For each test case print on a separate line the value of ab mod c.

Time limit 1 second
Memory limit 128 MiB
Input example #1
3 2 4
2 10 1000
Output example #1
1
24
Source Stage II All-Ukrainian Olympiad 2010-2011 Berdichev