#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;

ll mpow(ll x, ll p, ll mod)
{
    while( p > 0 )
    {
        if(p&1) x*=x;
        x %= mod;
        p >>= 1;
    }
    return x;
}

int main(){
    ll a,n,m;
    cin>>a>>n>>m;
    vector<ll> A(m,1);
    int cyc = 0;
    for(int i = 0; i < m; i++)
    {
        A[i+1] = mpow(a, A[i], m);
        if( A[i+1] == A[0] )
        {
            cyc = i+1;
            break;
        }
    }
    cout << A[n%cyc] << endl;
}