模板：快速幂

// luogu-judger-enable-o2
// luogu-judger-enable-o2
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define N 1000001
#define inf 1e9+7
int read()
{
    int f=1,x=0;char ch=getchar();
    while(ch>'9'||ch<'0'){if(ch=='-')f=-1; ch=getchar();}
    while (ch>='0'&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
    return f*x;
}
ll qpow(int n,int m,int k)
{
    if(n==0)return 0;
    ll base=n,ans=1;
    while(m)
    {
        if(m&1)ans=ans*base%k;
        base=base*base%k;
        m>>=1;
    }
    return ans%k;
}
int main()
{
    int b=read(),p=read(),k=read();
    printf("%d^%d mod %d=%lld",b,p,k,qpow(b,p,k));
}