#include <stdio.h>

int const MAX = 2010; 

int _pow(int A, int N, int M){
	if(0 >= N){ return 1; } 
	if(0 >= A){ return 0; } 
	if(1 >= M){ return 0; } 
	int b = _pow(A, N / 2, M); b = (b * b) % M; 
	if(0 == N % 2){ return b; }
	return (b * A) % M; 
}

void GetK0D(int A, int M, int &k0, int &d){
	static int memo[MAX]; 
	int r = 1, i = 0, j = 0; 
	for(i = 1; i <= M; ++i){
		memo[i-1] = r; r *= A; r %= M; 
		for(j = 0; j < i; ++j){
			if(r == memo[j]){ k0 = j; d = i - j; return; }
		}
	}
	k0 = -1; d = -1; 	
}

bool Flag(int A, int N, int k0){
	if(1 == N){ return k0 < A; } 
	if(5 <= A){ return true; } 
	if(4 == A){
		if(2 == N){ return k0 < 4 * 4 * 4 * 4; } 
		return true;  
	}else if(3 == A){
		if(2 == N){ return k0 < 3 * 3 * 3; } 
		return true; 
	}else{
		if(2 == N){ return k0 < 2 * 2; } 
		if(3 == N){ return k0 < 2 * 2 * 2 * 2; }
		return true; 
	}
	return false; 
}

int Arrow(int const A, int N, int const M){
	int B = A % M; 
	if(1 >= M){ return 0; } 
	if(0 >= N){ return 1; }
	if(1 == N){ return B; } 
	if(0 >= B){ return 0; }
	if(1 == B){ return 1; } 
	int k0, d; GetK0D(B, M, k0, d);
	if(-1 == k0){ return 0; }
	if(Flag(A, N - 1, k0)){ 
		int b = Arrow(A, N - 1, d); b = ((b - k0) % d + d) % d;
		return _pow(B, k0 + b, M); 
	}
	return _pow(B, Arrow(A, N - 1, M), M); 
}

int main(int argc, char *argv[]){
	int A, N, M; 

	scanf("%d %d %d", &A, &N, &M); 
	printf("%d\n", Arrow(A, N, M)); 

	return 0;
}