计算x^n %c
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <string>
#include <cstring>
#include <ctime>
#define ms(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
// 计算(a*b)%c. a,b都是long long 的数, 直接相乘可能溢出的
// a,b,c <2^63
long long mult_mod(long long a, long long b, long long c)
{
a %= c;
b %= c;
long long ret = 0;
while (b)
{
if (b & 1)
{
ret += a;
ret %= c;
}
a <<= 1;
if (a >= c)
{
a %= c;
}
b >>= 1;
}
return ret;
}
long long pow_mod(long long x, long long n, long long mod) ///x^n%c
{
if (n == 1)
{
return x % mod;
}
x %= mod;
long long tmp = x;
long long ret = 1;
while (n)
{
if (n & 1)
{
ret = mult_mod(ret, tmp, mod);
}
tmp = mult_mod(tmp, tmp, mod);
n >>= 1;
}
return ret;
}
int main()
{
ll x, n, mod;
while (cin >> x >> n >> mod)
{
cout << pow_mod(x, n, mod) << endl;
}
return 0;
}