#include<iostream>
using namespace std;
long long qm(long long a,long long b,long p)
{
	int ans=1,base=a;
	while(b>0)
	{
		if(b&1)
		{
		ans*=base;
		ans%=p;
		}
		base*=base;
		base%=p;
		b>>=1;
	}
	return ans;
}
int main()
{
	long long a,b,p,t;
	cin>>a>>b>>p;
	t=qm(a,b,p)%p;
	cout<<a<<"^"<<b<<" mod "<<p<<"="<<t; 
	return 0;
 }