#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

const int M_MAX = 2010;

// a^k(k>=0) mod mの周期を求める。
int cycle(int a, int m){
    vector<int> vis(m, -1);
    ll cur = 1;
    int res = -1;
    for(int i = 0;res==-1; ++i){
        if(vis[cur] != -1)res = i - vis[cur];
        else vis[cur] = i;
        cur = cur*a%m;
    }
    return res;
}

ll powMod(ll n, ll k, ll mod){
    if(n==0)return 0;
    ll res = 1;
    while(k){
        if(k&1)res=res*n%mod;
        n=n*n%mod;
        k>>=1;
    }
    return res;
}

const int MOD_MAX = 2016;
vi preCalc;
ll tetrationMod(int a, ll b, int m){
    if(m == 1)return 0;
    if(b == 0)return 1;

    // a↑↑(b-1)がMOD_MAX未満
    if(b - 1 < sz(preCalc)){
        return powMod(a, preCalc[b - 1], m);
    }

    int c = cycle(a, m);
    ll after = tetrationMod(a, b - 1, c) - MOD_MAX;
    after %= c;
    if(after < 0)after += c;
    return powMod(a, MOD_MAX + after, m);
}

int main(){
    int A, N, M;
    cin >> A >> N >> M;
    if(A == 1){
        cout << 1 % M << endl;
        return 0;
    }

    preCalc.push_back(1);
    for(int i = 0; ; ++i){
        ll x = 1;
        int ok = 1;
        rep(j, preCalc.back()){
            x *= A;
            if(x >= MOD_MAX){
                ok = 0;
                break;
            }
        }

        if(!ok)break;
        assert(x > preCalc.back());
        preCalc.push_back((int)x);
    }
    cout << tetrationMod(A, N, M) << endl;
}