// yukicoder: No.181 A↑↑N mod M
// 2019.7.4 bal4u

#include <stdio.h>
#include <string.h>

typedef long long ll;

int powmod(int a, int p, int m) {
	int r = 1;
	while (p) {
		if (p & 1) r = (ll)r * a % m;
		a = (ll)a * a % m;
		p >>= 1;
	}
	return r;
}

int t[2005];
int period(int a, int m) {
	int i, x;
	
	memset(t, 0, sizeof(t));
	t[0] = 0, x = 1;
	for (i = 1; ; i++) {
		x = (ll)x * a % m;
		if (t[x]) break;
		t[x] = i;
	}
	return i-t[x];
}

int calc(int a, int n, int m) {
	int r, k = 2001;
	int t = period(a, m);
	if (t == 1) return powmod(a, k, m);
	r = (calc(a, n-1, t) - k) % t;
	if (r < 0) r += t;
	return powmod(a, k+r, m);
}

int main()
{
	int A, N, M, ans;
	
	scanf("%d%d%d", &A, &N, &M);
	if (M == 1) ans = 0;
	else if (N == 0) ans = 1;
	else if (A == 1) ans = 1;
	else if (A % M == 0) ans = 0;
	else if (N == 1) ans = powmod(A, 1, M);
	else if (N == 2) ans = powmod(A, A, M);
	else if (A == 2 && N <= 4) ans = powmod(A, N == 4? 16: 4, M);
	else ans = calc(A, N, M);
	printf("%d\n", ans);
	return 0;
}