#include<iostream>
#include<cstdio>
#define N 10000001
#define Base 100000
using namespace std;
int read()
{
    char c=0;
    int sum=0;
    while (c<'0'||c>'9') c=getchar();
    while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
    return sum;
}
int n,q,invq,mod,pwa[N+1],pwb[N+1],pw[N+1],s1[N+1],s2[N+1],invs[N+1],invpw[N+1],qnum[N+1],qfac[N+1],invqfac[N+1],dp[N+1],ans;
void Adder(int &x,int d)
{
    x+=d;
    if (x>=mod) x-=mod;
    return;
}
void Adder2(int &x,int d)
{
    x+=d;
    if (x<0) x+=mod;
    return;
}
int MD(int x)
{
    return (x>=mod)?x-mod:x;
}
int MD2(int x)
{
    return (x<0)?x+mod:x;
}
int fast_pow(int a,int b)
{
    int res=1,mul=a;
    while (b)
    {
	if (b&1) res=1ll*res*mul%mod;
	mul=1ll*mul*mul%mod,b>>=1;
    }
    return res;
}
int qC(int x,int y)
{
    if (x<y) return 0;
    return 1ll*qfac[x]*invqfac[y]%mod*invqfac[x-y]%mod;
}
int get_fast_pow(int x)
{
    return 1ll*pwa[x%Base]*pwb[x/Base]%mod;
}
int main()
{
    int cst,rst,kst,dst=1,rest,delta,ds,d1,d2;
    n=read(),q=read(),mod=read(),qfac[0]=pw[0]=invpw[0]=pwa[0]=pwb[0]=s1[0]=s2[n+2]=1,cst=MD2(q-1),rst=fast_pow(cst,mod-2),invq=fast_pow(q,mod-2),rest=1ll*cst*invq%mod;
    for (int i=1;i<=Base;++i) pwa[i]=3ll*pwa[i-1]%mod;
    for (int i=1;i<=Base;++i) pwb[i]=1ll*pwb[i-1]*pwa[Base]%mod;
    for (int i=1;i<=n+1;++i) pw[i]=1ll*pw[i-1]*q%mod,invpw[i]=1ll*invpw[i-1]*invq%mod;
    delta=1ll*MD2(pw[n+1]-pw[n])*rest%mod,ds=MD(MD2(pw[n+1]-pw[n])+rest);
    for (int i=1;i<=n+1;++i) s1[i]=1ll*s1[i-1]*MD2(1-pw[i])%mod;
    for (int i=n+1;i>=1;--i) s2[i]=1ll*s2[i+1]*MD2(1-pw[i])%mod;
    kst=fast_pow(s1[n+1],mod-2);
    for (int i=1;i<=n+1;++i) invs[i]=1ll*s1[i-1]*s2[i+1]%mod*kst%mod;
    for (int i=1;i<=n+1;++i) qnum[i]=1ll*MD2(pw[i]-1)*rst%mod;
    for (int i=1;i<=n+1;++i) qfac[i]=1ll*qfac[i-1]*qnum[i]%mod;
    invqfac[n+1]=fast_pow(qfac[n+1],mod-2);
    for (int i=n;i>=0;--i) invqfac[i]=1ll*invqfac[i+1]*qnum[i+1]%mod;
    dp[0]=1,dp[1]=MD2(MD2(pw[n]-pw[n-1])-1);
    for (int i=2;i<=n;++i)
    {
	d1=MD2(MD(1ll*MD(cst+rest)*pw[i-1]%mod+1ll*MD2(pw[n]-pw[n-1])*invpw[i-1]%mod)-ds);
	d2=MD2(1ll*cst*rest%mod*pw[i-2]%mod-delta);
	dp[i]=1ll*MD(1ll*d1*dp[i-1]%mod+1ll*d2*dp[i-2]%mod)*invs[i]%mod;
    }
    for (int i=0;i<=n;++i) dp[i]=1ll*dp[i]*invqfac[n-i]%mod;
    for (int i=1;i<=n;++i) dst=1ll*dst*q%(mod-1);
    for (int i=0,res=1;i<=n;++i,res=1ll*res*dst%(mod-1)) Adder(ans,1ll*dp[n-i]*get_fast_pow(res)%mod);
    printf("%lld\n",1ll*ans*qfac[n]%mod);
    return 0;
}