//指数求模(建议再了解一下两数相乘求模)
#include<bits/stdc++.h>
using namespace std;
int qmi(int a,int b,int p)
{int res=1;
while(b)
{
if(b%2)
res=(long long )res*a%p;
b/=2;
a=(long long)a*a%p;
}
return res;
}
int main()
{
int a,b,p;
cin>>a>>b>>p;
qmi(a,b,p);
printf("%lld^%lld mod %lld=%lld\n",a,b,p,qmi(a,b,p));
return 0;
}