#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,-1,0,1,1,1,-1,-1,0};
const ll dx[9]={-1,0,1,0,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
ll eular_phi(ll n){
  ll ret=n;
  for(ll i=2;i*i<=n;i++){
    if(n%i==0){
      ret-=ret/i;
      while(n%i==0)n/=i;
    }
  }
  if(n>1)ret-=ret/n;
  return ret;
}
ll modpow(ll a,ll n, ll mod) {
  a%=mod;if(a==0)return 0;
  ll res = 1;
  while (n > 0) {
      if (n & 1) res = res * a % mod;
      a = a * a % mod;
      n >>= 1;
  }
  return res;
}
ll safemod(ll a,ll mod){
    return (a%mod+mod)%mod;
}
ll calc(ll a,ll n,ll m){
    //cout << a <<" " << n << " " << m << endl;
    if(m==1)return 0;
    if(n==0)return 1;
    ll upper=INF;
    n--;
    {

        if(a==1)upper=1;
        else{
            if(n==0)upper=1;
            else if(n==1)upper=a;
            else if(n==2&&a<=16)upper=modpow(a,a,INF);
            else if(n==3&&a==2){
                upper=16;
            }
        }
    }
    auto p=eular_phi(m);
    //cout << p <<" " << m << endl;
    if(upper!=INF)return modpow(a,upper,m);
    else return modpow(a,m+safemod(calc(a,n,p)-m,p),m);
}
int main(){
    ll a,n,m;cin >> a >> n >> m;
    cout << calc(a,n,m) << endl;
}