#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)
{
    ll res = 1;
    while( p > 0 )
    {
        if(p&1) res *= x;
        x = x*x%mod;
        res %= mod;
        p >>= 1;
    }
    return res;
}

int main(){
    ll a,n,m;
    cin>>a>>n>>m;
    vector<ll> A(m+1,1);
    cerr << 0 << " " << 1 << endl;
    int cyc = 0, offset = 0;
    for(int i = 0; i < m; i++)
    {
        A[i+1] = mpow(a, A[i], m);
        std::cerr << i+1 << " " << A[i+1] <<endl;
        for(int j = 0; j < i + 1; j++)
            if( A[i+1] == A[j] )
            {
                cyc = i+1 - j;
                offset = j;
            }
        if(i+1==n)
        {
            cout<<A[i+1] << endl;
            return 0;
        }

    }
    cout << A[n >= offset ? (offset + (n-offset)%cyc):n]%m << endl;
}