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

long long a, b, p;

int quick_pow(int n, int q, int k)
{
	int ans = 1;
	while(q > 0)
	{
		if(q % 2 != 0) ans = ans * n % k;
		n = n * n % k;
		q = q >> 1;
	}
	ans %= k;
	return ans;
}

int main()
{
	cin >> a >> b >> p;
	cout << a << "^" << b << " mod " << p << "=" << quick_pow(a, b, p); 
	return 0;
}