#include <bits/stdc++.h>

using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;


// x^n % md
ll pow_mod(ll x, ll n, ll md) {
    ll r = 1;
    while (n) {
        if (n & 1) r = (r * x) % md;
        x = (x * x) % md;
        n >>= 1;
    }
    return r;
}

typedef pair<ll, ll> P;

int main() {
    ll a, n, m;
    cin >> a >> n >> m;
    ll x = 1;
    map<ll, ll> mp;
    for (int i = 0; i < 100000; i++) {
        x = pow_mod(a, x, m);
        if (mp.count(x)) {
            if (n < mp[x]) break;
            n -= mp[x];
            n %= (i+1) - mp[x];
            n += mp[x];
            break;
        }
        mp[x] = i+1;
    }
    x = 1;
    for (int i = 0; i < n; i++) {
        x = pow_mod(a, x, m);
    }
    cout << x << endl;
    return 0;
}