#include<bits/stdc++.h>
using namespace std;
long long n,m,p;
long long fastpow(long long n,long long m){
    if(m<=1) return 1;
    int ans=1%p,cur=fastpow(n,m>>1)%p;
    ans=((cur%p)*(cur%p))%p;
    if(m&1) ans=((ans%p)*(n%p))%p;
    return ans;
}
int main(){
    cin>>n>>m>>p;
    cout<<n<<"^"<<m<<" mod "<<p<<"="<<fastpow(n,m)<<endl;
    return 0;
}

苦苦调了114514毫秒（