#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}

signed MOD = 1000000007;
template<typename T>
struct Mint{
  T v;
  Mint():v(0){}
  Mint(signed v):v(v){}
  Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}

  Mint pow(long long k){
    Mint res(1),tmp(v);
    while(k){
      if(k&1) res*=tmp;
      tmp*=tmp;
      k>>=1;
    }
    return res;
  }
  
  Mint inv(){return pow(MOD-2);}
  
  Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
  Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
  Mint& operator/=(Mint a){return (*this)*=a.inv();}
  
  Mint operator+(Mint a) const{return Mint(v)+=a;};
  Mint operator-(Mint a) const{return Mint(v)-=a;};
  Mint operator*(Mint a) const{return Mint(v)*=a;};
  Mint operator/(Mint a) const{return Mint(v)/=a;};

  Mint operator-(){return v?MOD-v:v;}

  bool operator==(const Mint a)const{return v==a.v;}
  bool operator!=(const Mint a)const{return v!=a.v;}
  bool operator<(const Mint a)const{return v<a.v;}

};

Int euler_phi(Int n){
  Int res=n;
  for(Int i=2;i*i<=n;i++){
    if(n%i==0){
      res=res/i*(i-1);
      for(;n%i==0;n/=i);
    }
  }
  if(n!=1) res=res/n*(n-1);
  return res;
}

//INSERT ABOVE HERE

signed main(){
  Int a,n,m;
  cin>>a>>n>>m;
  if(m==1){
    cout<<0<<endl;
    return 0;
  }
  if(n==0){
    cout<<1<<endl;
    return 0;
  }
  MOD = euler_phi(m);
  
  using M = Mint<int>;
  map<M, int> dp;
  M r(1);
  dp[r]=0;

  n--;
  for(int i=1;i<=n;i++){
    r=M(a).pow(r.v+MOD);
    if(dp.count(r)){
      int k=i-dp[r];
      int d=((n-i)/k-1)*k;
      if(d>=0) i+=d;      
    }
    dp[r]=i;
  }
  int k=r.v+MOD;
  
  MOD = m;
  M ans=M(a).pow(k);
  cout<<ans.v<<endl;
  return 0;
}