#include<iostream>
#include<cstdio>
using namespace std;
long long i,j,k;
long long n,m,p;

long long QP(long long a,long long b)
{
	long long ans=1,base=a;
	while(b>0)
    {
    	
		if(b%2==1)
		{
			ans*=base%k;
		}
        base*=base%k;
		b>>=1;		
	}
	return ans%k;
}

int main()
{
//	freopen("1.txt","r",stdin);
	scanf("%lld %lld %lld",&n,&m,&k);
	p=QP(n,m);
	p=p%k;
	printf("%lld^%lld mod %lld=%lld",n,m,k,p);
	return 0;
}