//快速幂代码
#include<iostream>
#include<map>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
ll qu(ll a, ll b,ll p) {
ll ans = 1;
while (b) {
if (b & 1)ans = ans * a % p;
a = a * a % p;
b >>= 1;
}
return ans;
}
int main() {
ll a, b, p;
cin >> a >> b >> p;
ll ans = qu(a, b, p)%p;
cout << ans << endl;
}