tj

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

long long a,b,p;

int ksm(int a,int b,int p){
	int s = 1;
	while(b != 0){
		if(b % 2 == 1){
			s = (s * a) % p;
		}
		b /= 2;
		a = (a * a) % p;
	}
	return s;
	
} 

signed main(){
	cin >> a >> b >> p; //输出 
	
	long long ans = ksm(a,b,p); //计算结果（保存） 
	printf("%lld^%lld mod %lld=%lld\n",a,b,p,ans); //输出 
	
	return 0;
}