#include<bits/stdc++.h>
using namespace std;
const int N=1e7+5;
int n,q,mod,ans;
int ksm(int a,long long x,int p=mod){
	int tot=1;
	while(x){
		if(x & 1ll) tot=1ll*tot*a%p;
		a=1ll*a*a%p;
		x>>=1ll;
	}
	return tot;
}
int pw[N],ipw[N],PW[N],mul[N],inv[N];
int pw_nk[N],ipw_knk[N],pw_nnkk[N];
void init(int lim){
	int invq=ksm(q,mod-2);
	
	pw[0]=ipw[0]=1;
	for(int i=1;i<=lim;i++) pw[i]=1ll*pw[i-1]*q%mod;
	for(int i=1;i<=lim;i++) ipw[i]=1ll*ipw[i-1]*invq%mod;
	
	int pwn=ksm(q,n,mod-1);
	pw_nk[0]=1;
	for(int i=1;i<=lim;i++) pw_nk[i]=1ll*pw_nk[i-1]*pwn%(mod-1);
	
	ipw_knk[0]=1;
	for(int i=1;i<=lim;i++) ipw_knk[i]=1ll*ipw_knk[i-1]*ipw[n]%mod*pw[i-1]%mod*pw[i-1]%mod;
	
	pw_nnkk[0]=ksm(q,1ll*n*(n-1)/2%(mod-1));
	for(int i=1;i<=lim;i++) pw_nnkk[i]=1ll*pw_nnkk[i-1]*ipw[i-1]%mod;
	
	
	for(int i=1;i<=lim;i++) PW[i]=(1+mod-pw[i])%mod;
	
	mul[0]=inv[0]=1;
	for(int i=1;i<=lim;i++) mul[i]=1ll*mul[i-1]*PW[i]%mod;
	inv[lim]=ksm(mul[lim],mod-2);
	for(int i=lim-1;i>=1;i--) inv[i]=1ll*inv[i+1]*PW[i+1]%mod;
	
}
int C(int m,int n){
	if(m<0 || n<0 || m<n) return 0;
	return 1ll*mul[m]*inv[n]%mod*inv[m-n]%mod;
}
int ID(int x){
	return (x & 1ll)?mod-1:1;
}

int f[N],g[N];

int main(){
	cin>>n>>q>>mod;
	init(N-5);
	
	g[0]=1;
	for(int k=1;k<=n;k++){
		g[k]=(1ll*g[k-1]*(1+mod-ipw[n-k+1])%mod+1ll*ipw_knk[k]*inv[k]%mod)%mod;
	}
	
	for(int k=0;k<=n;k++){
		f[k]=1ll*g[n-k]*ID(n-k)%mod*mul[n-k]%mod*C(n,k)%mod*pw_nnkk[k]%mod;
	}
	for(int i=0;i<=n;i++) ans=(ans+1ll*f[i]*ksm(3,pw_nk[i])%mod)%mod;
	cout<<ans;
}