#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = 1<<25;
typedef pair<int,int> P;
typedef long long ll;
typedef unsigned long long ull;
#define N 3010

ll a, n, m;
int prime[N];
vector<int> p;

ll mypow(ll a, ll n, ll m){
	a %= m;
	ll r = 1;
	while(n){
		if(n&1) r = r*a%m;
		a = a*a%m;
		n >>= 1;
	}
	return r;
}

ll phi(ll m){
	int pos = 0;
	while(p[pos]<=m){
		if(!(m%p[pos])) m = m/p[pos]*(p[pos]-1);
		pos++;
	}
	return m;
}

ll tet(ll a, ll n, ll m){
	if(n==0) return 1;
	if(m==1) return 0;
	ll m2 = phi(m);
	ll b = tet(a, n-1, m2)+m2;
	return mypow(a, b, m);
}


int main(){
	prime[0] = prime[1] = 1;
	for(int i = 2; i < sqrt(N); i++){
		if(prime[i]) continue;
		for(int j = i*i; j < N; j+=i)
			prime[j] = 1;
	}
	for(int i = 2; i < N; i++)
		if(!prime[i]) p.push_back(i);
	cin>>a>>n>>m;
	if(n==0 || a==1) cout<<1%m<<endl;
	else if(a==0) cout<<0<<endl;
	else if(n==1) cout<<a%m<<endl;
	else if(n==2) cout<<mypow(a, a, m)%m<<endl;
	else cout<<tet(a, n, m)%m<<endl;
	return 0;
}