#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a,b,p;
ll qpow(ll a,ll n)
{
    if (n == 0)
        return 1;
    else if (n % 2 == 1)
        return qpow(a, n - 1)%p * a;
    else
    {
        int temp = qpow(a, n / 2)%p;
        return temp*temp%p;
    }
}
int main()
{
    cin>>a>>b>>p;
    printf("%lld^%lld mod %lld=%lld",a,b,p,qpow(a,b));
    return 0;
}