#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 ;

 }

int f(int x)

{

    if(x==)return ;//任何数的0次方模k都等于1

    int tmp=f(x/)%k;//a*b%k=a%k*b%k%k;

    tmp=(tmp*tmp)%k;

    if(x%==)tmp=(tmp*b)%k;

    return tmp;

}