#include <bits/stdc++.h>
#define int long long
using namespace std;
int p;
int kuaisumi(int a,int x){
if(x==0) return 1;
if(x==1) return a;
int k=kuaisumi(a,x/2);
if(x%2==0){
return k*k%p;
}
else{
return a*(k*k%p)%p;
}
}
signed main(){
freopen("dmod.in","r",stdin);
freopen("dmod.out","w",stdout);
int a,n;
scanf("%lld%lld%lld",&a,&n,&p);
int ret=kuaisumi(a,n)%p;
printf("%lld",ret);
return 0;
}