#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

long long mypow(long long x, long long y, long long MOD){
	if(x==0 && y!=0) return 0;
	long long ret=1LL;
	while(y>0LL){
		if(y&1LL) ret = (ret * x) % MOD;
		x = (x*x) % MOD;
		y >>= 1LL;
	}
	return ret;
}

pair<int,int> func(long long A, long long M){
	int u=0,v=0;
	vector<long long> memo(M+1, -1);
	for(long long i=0, val=1; i<M; i++, val=val*A%M){
		if(memo[val] >= 0){
			u = memo[val];
			v = i - memo[val];
			break;
		}
		memo[val] = i;
	}

	return {u,v};
}

// A^A^A...^A > u
bool greater__(long long A, long long N, long long u){
	if(u==0) return true;
	if(A==1) return A > u;
	double val = 1;
	for(int i=0; i<N; i++){
		if(val>u) return true;
		val = pow(1*A, val);
	}
	return false;

}

long long dfs(long long A, long long N, long long u, long long M){
	if(A==0) return 0;
	if(N==0){
		return 1%M;
	}
	if(M==1){
		return 0;
	}
	auto x = func(A,M);
	bool g = greater__(A,N, x.first);
	if(g==false){
		return mypow(A, N, M);
	}

	long long ret = dfs(A%x.second, N-1, x.first, x.second);
	ret = mypow(A, ret, M);
	ret = (ret-u+M)%M * mypow(A, x.first, M) % M;
	return ret;
}

int main(){
	long long A,N,M;
	cin >> A >> N >> M;

	if(M==1){
		cout << 0 << endl;
		return 0;
	}
	if(N==0){
		cout << 1 << endl;
		return 0;
	}
	if(A==1){
		cout << 1 << endl;
		return 0;
	}

	long long ans = dfs(A%M, N, 0, M);
	cout << ans << endl;



	return 0;
}