#include<bits/stdc++.h>
#define ll long long
using namespace std;

ll a,b,p;
ll s;

long long fast_pow(ll base,ll power,ll p){
	ll n;
	while(power>0){
		if(power%2==1){
			n *= base%p;
		}
		power /= 2;
		n *= (base*base)%p;
	}
	return n%p;
} 

int main(){
	
	cin >> a >> b >> p;
	s = fast_pow(a,b,p);
//	printf("%lld^%lld mod %lld=%lld",a,b,p,s);
	cout << a << "^" << b << " mod " << p << "=" << s;
	
	return 0;
}