#include "bits/stdc++.h"
using namespace std;

long long dfs(int A, int N, int M){
	if (N == 0) return 1;
	if (N == 1)
	{
		return A;
	}
	if (N == 2){
		if (A < 7){
			long long ans = 1;
			for (int i = 0; i < A; i++)
			{
				ans *= A;
			}
			return ans;
		}
	}
	if (M <= 1)
	{
		return 3000;
	}
	vector<long long> v;
	if (A % M == 0) return 0;
	long long temp = 1;
	map<long long, int> m;
	bool ok = false;
	do{
		m[temp] = v.size() + 1;
		v.push_back((int)temp);
		temp *= A;
		if (temp >= M * 3001){
			temp %= M;
			temp += M * 3000;
			ok = true;
		}
		if (ok && temp < M * 3000){
			temp %= M;
			temp += M * 3000;
		}
	} while (m[temp] == 0);
	int loop = v.size() - (m[temp] - 1);
	int nextminus = (int)v.size() - loop;

	int r = dfs(A, N - 1, loop);
	if (r >= nextminus){
		r %= loop;
		while (r < nextminus) r += loop;
	}
	return v[r];
}

int main() {
	int A, N, M;
	cin >> A >> N >> M;
	cout << dfs(A, N, M) % M << endl;
	cin >> A;
}