#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsigned int
#define ull unsigned long long 
#define bs bitset < N >
using namespace std;
const int N = 5e5 + 7;
int n, q, mod;
int pw[N], fac[N], ifac[N];
int qpow(int x, int y = mod - 2) {
	int res = 1;
	for(; y; x = (ll) x * x % mod, y >>= 1) if(y & 1) res = (ll) res * x % mod;
	return res;
}
void q_init(int x) {
	pw[0] = 1;
	L(i, 1, x) pw[i] = (ll) pw[i - 1] * q % mod;
	L(i, 1, x) fac[i] = (fac[i - 1] + pw[i - 1]) % mod;
	fac[0] = ifac[0] = 1;
	L(i, 1, x) 
		ifac[i] = (ll) qpow (fac[i]) * ifac[i - 1] % mod, 
		fac[i] = (ll) fac[i - 1] * fac[i] % mod;
} 
int q_C(int x, int y) {
	return x < y || y < 0 ? 0 : (ll) fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}

int f[N];
int nig[N];
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> q >> mod;
	q_init(n + 1);
	L(i, 0, n) {
		int prd = 1;
		L(j, 0, i - 1) 
			prd = (ll) prd * (pw[i] + mod - pw[j]) % mod;
		f[i] = (ll) prd * qpow(q, (ll)i * (n - i) % (mod - 1)) % mod;
	}
	L(i, 0, n) 
		L(j, 0, i - 1) 
			(f[i] += mod - (ll) f[j] * q_C(i, j) % mod) %= mod;
	L(i, 0, n) {
		f[i] = (ll) f[i] * q_C(n, i) % mod;
	}
	int pw = 1;
	L(i, 1, n) {
		pw = (ll) pw * q % (mod - 1);
	}
	int s = 1, ns = 0;
	R(i, n, 0) {
		(ns += (ll) f[i] * qpow(3, s) % mod) %= mod;
		s = (ll) s * pw % (mod - 1);
	}
	cout << ns << '\n';
	return 0;
}