#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;
int b,p,k;
int f(int);
int main()
{
    scanf("%d%d%d",&b,&p,&k);
    int tmpb=b;
    b%=k;//防止b过大 
    printf("%d^%d mod %d=%d\n",tmpb,p,k,f(p));    
    return 0;
 } 
int f(int x)
{
    if(x==0)return 1;//任何数的0次方模k都等于1 
    int tmp=f(x/2)%k;//a*b%k=a%k*b%k%k;
    tmp=(tmp*tmp)%k;
    if(x%2==1)tmp=(tmp*b)%k;
    return tmp;
}