#include <bits/stdc++.h>
using namespace std;
long long a,b,p;
long long mul(long long a,long long b,long long m)
{
	long long t = a % m,r = 0;
	while (b)
	{
		if (b & 1)
			r = (r + t) % m;
		t = (t + t) % m;
		b = b >> 1;
	}
	return r;
}
long long qpow(long long a,long long b,long long m)
{
	long long t = a % m,r = 1;
	while (b)
	{
		if (b & 1)
			r = mul(r,t,m);
		t = mul(t,t,m);
		b = b >> 1;
	}
	return r;
}
int main()
{
	scanf("%lld%lld%lld",&a,&b,&p);
	printf("%lld",qpow(a,b,p));
	return 0;
}