#include<bits/stdc++.h>
using namespace std;
long long quickpow(long long n,long long m,long long p)
{
	long long s;
	while(n)
	{
		if(n&1)
		{
			s=(s*(m%p))%p;
		}
		n=n>>1;
		m=((m%p)*(m%p))%p;
	}
	return s;
}
int main()
{
	int n,m,p;
	cin>>n>>m>>p;
	cout<<n<<'^'<<m<<" mod "<<p<<"="<<quickpow(n,m,p);
	return 0;
}