[hihoCoder]1777 彩球

#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>

using namespace std;

// 快速乘

long long fastMultiply(long long a, long long b, long long p) {

	long long ans = 0;
	long long t = a;

	while (b) {
		if (b & 1) {
			ans = (ans + t) % p;
		}
		t = (t + t) % p;
		b = b >> 1;
	}

	return ans;
}


// 快速幂
long long fastPow(long long n, long long k, long long p) {
	long long ans = 1;
	long long t = n;
	while (k) {
		if (k & 1) {
			ans = fastMultiply(ans, t, p);
		}
		t = fastMultiply(t, t, p);
		k = k >> 1;
	}
	return ans;
}



int main(int argc, char const *argv[]) {

	long long n, k, p;
	scanf("%lld%lld%lld", &n, &k, &p);

	printf("%lld\n", fastPow(k, n, p));

	return 0;
}