#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

vector<bool> isprime;
vector<int> primes;
void sieve(int n){
	if((int)isprime.size() >= n+1) return;
	isprime.assign(n+1, true);
	isprime[0] = isprime[1] = false;
	int sqrtn = (int)(sqrt(n * 1.) + .5);
	for(int i = 2; i <= sqrtn; i ++) if(isprime[i]) {
		for(int j = i * i; j <= n; j += i)
			isprime[j] = false;
	}
	primes.clear();
	for(int i = 2; i <= n; i ++) if(isprime[i])
		primes.push_back(i);
}
typedef unsigned long long ull;

unsigned red(ull x, unsigned m) {
	return x >= m ? (unsigned)(x - m) : (unsigned)x;
}

ull mulMod(ull x, ull y, unsigned m) {
	if(x > y) swap(x, y);
	unsigned z = (ull)red(x, m) * red(y, m) % m;
	if(x != 0 && (y >= m || x * y >= m))
		return (ull)m + z;
	else
		return z;
}

ull powMod(ull x, ull y, unsigned m) {
	ull r = 1, a = x;
	while(y > 0) {
		if(y & 1) r = mulMod(r, a, m);
		a = mulMod(a, a, m);
		y >>= 1;
	}
	return r;
}

unsigned phi(unsigned n) {
	unsigned res = n;
	each(pi, primes) {
		int p = *pi;
		if((ll)p * p > n) break;
		if(n % p == 0) {
			for(n /= p; n % p == 0; ) n /= p;
			res -= res / p;
		}
	}
	if(n > 1) res -= res / n;
	return res;
}

ull toMod(unsigned x, unsigned m) {
	if(x >= m)
		return (ull)m + x % m;
	else
		return x;
}

int main() {
	sieve(1 << 16);
	int T = 1;
	rep(ii, T) {
		unsigned X, N, M;
		scanf("%u%u%u", &X, &N, &M);
		vector<unsigned> orders;
		orders.push_back(M);
		while(orders.back() > 1) {
			unsigned p = phi(orders.back());
			orders.push_back(p);
		}
		unsigned K = (unsigned)orders.size();
		ull r = X == 0 && K < N && (N - K) % 2 != 0 ? 0 : 1;
		for(int i = min(K, N); i > 0; -- i) {
			unsigned m = orders[i - 1];
			r = powMod(toMod(X, m), r, m);
		}
		unsigned ans = red(r, M);
		printf("%u\n", ans);
	}
	return 0;
}