#include <iostream>
#include <iomanip>

#include <algorithm>

#include <cmath>
#include <cctype>
#include <climits>
#include <cassert>

#include <string>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>

#include <random>

#include <bitset>

#include <complex>

#include <utility>

#include <numeric>

#include <functional>


using namespace std;
using ll = long long;
using P = pair<ll,ll>;

ll MOD = 998244353;
const ll MODx = 1000000007;
const int INF = (1<<30)-1;
const ll LINF = (1LL<<62LL)-1;
const double EPS = (1e-10);

P ar4[4] = {{0,1},{0,-1},{1,0},{-1,0}};
P ar8[8] = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};




template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }
 
 /*
確認ポイント
cout << fixed << setprecision(n) << 小数計算//n桁の小数表記になる

計算量は変わらないが楽できるシリーズ
min(max)_element(iter,iter)で一番小さい(大きい)値のポインタが帰ってくる
count(iter,iter,int)でintがiterからiterの間にいくつあったかを取得できる
*/

/*
function corner below
*/


/*
Function corner above
*/

/* comment outed because can cause bugs
__attribute__((constructor))
void initial() {
 cin.tie(0);
 ios::sync_with_stdio(false);
}
*/
long long modadd(long long A, long long B){
  return (A+B)%MOD;
}

long long modsub(long long A, long long B){
  return ((A-B)%MOD+MOD)%MOD;
}

long long modmul(long long A, long long B){
  return (A*B)%MOD;
}

long long modpow(long long A, long long B){
  long long ret = 1;
  long long nw = A;
  while(B){
    if(B%2 == 1){
      ret = modmul(ret, nw);
    }
    B/=2;
    nw = modmul(nw, nw);
  }
  return ret;
}

long long modinv(long long A){
  return modpow(A, MOD-2);
}

long long moddiv(long long A, long long B){
  return modmul(A, modinv(B));
}

int main(){
  map<int,int> ind;
  long long a,n;cin>>a>>n>>MOD;
  if(n == 0){
    cout << 1 << endl;
    return 0;
  }else if(n == 1){
    cout << a << endl;
    return 0;
  }n--;
  long long cur = a%MOD;
  int index = 1;
  ind[cur] = index++;
  cur = modpow(a, cur);
  vector<long long> z = {cur};
  while(!ind[cur]){
    n--;
    if(n == 0){
      cout << cur << endl;
      return 0;
    }
    ind[cur] = index++;
    cur = modpow(a, cur);
    z.push_back(cur);
  }
  //cout << ind[cur] << " " << index << endl;
  long long nex = n%(index-ind[cur]);
  cout << z[ind[cur]-1+nex] << endl;
  return 0;
}