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