#include <iostream>
using namespace std;
typedef long long ll;
// 快速幂取模
/*
b是偶数时:
a^b mod p = ((a^2)^(b/2)) mod p;
b是奇数时:
a^b mod p = ((a^2)^(b/2)*a) mod p;
当b为奇数时相较于b为偶数时多乘了一个a
*/
ll qmi(ll a, ll b, ll p) {
ll res = 1;
while (b) {
if (b & 1) { //等价于 b%2 == 1
res = res * a % p;
}
b >>= 1; //等价于 b = b/2
a = a * a % p;
}
return res;
}
int main() {
ll a, b, p;
cin >> a >> b >> p;
cout << qmi(a,b,p) % p << endl;
return 0;
}