#include <bits/stdc++.h>

#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;

const int MAXN = 3000;
int phi[MAXN];

void initPhi() {
    for (int i = 0; i < MAXN; i++) phi[i] = i;
    for (int i = 2; i < MAXN; i++) {
        if (i == phi[i]) {
            for (int j = 1; i*j < MAXN; j++) {
                phi[i*j] -= phi[i*j]/i;
            }
        }
    }
}

ll check(ll A, ll N) {
    if (A==1) return 1;
    ll ret = 1;
    for (int i = 0; i < N; i++) {
        ll tmp = ret;
        ret = 1;
        for (int j = 0; j < tmp; j++) {
            ret *= A;
            if (ret > 3000) return 3000;
        }
    }
    return ret;
}

// a^p mod mを求める
ll modpow(ll a, ll p, ll m) {
    if (a == 0) return 0;
    if (p == 0) return 1;
    if (p%2 == 0) {
        ll tmp = modpow(a, p/2, m);
        return tmp*tmp % m;
    } else {
        return a*modpow(a, p-1, m) % m;
    }
}

// a^^n mod mを求める
ll H(ll a, ll n, ll m) {
    if (m == 1) return 0;
    if (n == 0) return 1;
    ll tmp = check(a, n);
    if (tmp < 3000) return tmp%m;
    return modpow(a, 3000+(H(a, n-1, phi[m])-3000)%phi[m], m);
}

int main() {
    initPhi();
    ll A, N, M;
    cin >> A >> N >> M;
    if (M == 1) {
        cout << 0 << endl;
    } else if (N == 0 || A == 1) {
        cout << 1 << endl;
    } else {
        cout << H(A, N, M) << endl;
    }
    return 0;
}