#include<bits/stdc++.h>
using namespace std;
int n,m,jc[9010000],ij[9001000],mod;
int qpow(int a,int b){
    int c=1;
    for(;b;b>>=1){
        if(b&1)c=1ll*a*c%mod;
        a=1ll*a*a%mod;
    }
    return c;
}
int dp[3010][3010];
int O(int a,int b){return 1ll*jc[a]*ij[a-b]%mod;}
void ad(int &x,int y){x+=y;if(x>=mod)x-=mod;}
int main(){
    scanf("%d%d%d",&n,&m,&mod);jc[0]=1;
    for(int i=1;i<=n*m;i++)jc[i]=1ll*i*jc[i-1]%mod;
    ij[n*m]=qpow(jc[n*m],mod-2);for(int i=n*m;i;i--)ij[i-1]=1ll*i*ij[i]%mod;
    dp[1][1]=1;
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){
        if(j<m)(dp[i][j+1]+=1ll*dp[i][j]*O(n*m-i*j-1,i-1)%mod*i%mod)%=mod;
        if(i<n)(dp[i+1][j]+=1ll*dp[i][j]*O(n*m-i*j-1,j-1)%mod*j%mod)%=mod;
    }
    printf("%lld\n",1ll*dp[n][m]*jc[n]%mod*jc[m]%mod);
    return 0;
}