#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

ULL A, N, M;
ULL powA[2001];
ULL cys, cyt;
ULL P[30][2001];

ULL applycycle(ULL idx) {
    if (idx < cys) return idx;
    ULL cyz = cyt - cys;
    return (idx - cys) % cyz + cys;
}

ULL powapplycycle(ULL a, ULL i) {
    if (i == 0) return applycycle(1);
    ULL res = powapplycycle(applycycle(a * a), i / 2);
    if (i % 2 == 1) res = applycycle(res * a);
    return res;
}

int main() {
    cin >> A >> N >> M;
    powA[0] = 1 % M; rep(i, M) powA[i + 1] = powA[i] * A % M;
    cys = cyt = ~0ull;
    rep(i, M + 1) {
        for (int j = i + 1; j <= M; j++) if (powA[i] == powA[j]) { cyt = j; break; }
        if (cyt != ~0ull) { cys = i; break; }
    }

    rep(i, cyt) P[0][i] = powapplycycle(A, i);
    rep(d, 29) rep(i, cyt) P[d + 1][i] = P[d][P[d][i]];

    ULL ans;

    if (N == 0) ans = 1;
    else {
        N--;
        ans = applycycle(1);
        rep(d, 30) if (N & (1 << d)) ans = P[d][ans];
        ans = powA[ans];
    }

    cout << ans << endl;

    return 0;
}