#include<bits/stdc++.h>
#define re signed
#define LL long long
inline int read() {
	char c=getchar();int x=0;while(c<'0'||c>'9')c=getchar();
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+c-48,c=getchar();return x;
}
const int maxn=3005;
int dp[maxn][maxn],ans,mod,fac[maxn*maxn],ifac[maxn*maxn];
inline int C(int n,int m) {
	return m>n?0:1ll*fac[n]*ifac[n-m]%mod*ifac[m]%mod;
}
inline int qm(int x) {return x>=mod?x-mod:x;}
inline int dqm(int x) {return x<0?x+mod:x;}
int n,m;
int main() {
	n=read(),m=read(),mod=read();
	dp[1][1]=n*m;fac[0]=ifac[0]=ifac[1]=1;
	for(re int i=1;i<=n*m;++i)fac[i]=1ll*fac[i-1]*i%mod;
	for(re int i=2;i<=n*m;++i)ifac[i]=1ll*(mod-mod/i)*ifac[mod%i]%mod;
	for(re int i=2;i<=n*m;++i)ifac[i]=1ll*ifac[i-1]*ifac[i]%mod;
	for(re int i=1;i<=n;++i) 
		for(re int j=1;j<=m;j++) {
			if(i==n||j==m) {ans=qm(ans+1ll*dp[i][j]*fac[n*m-i*j]%mod);continue;}
			dp[i+1][j]=qm(dp[i+1][j]+1ll*dp[i][j]*j%mod*(n-i)%mod*C(n*m-i*j-1,j-1)%mod*fac[j-1]%mod);
			dp[i][j+1]=qm(dp[i][j+1]+1ll*dp[i][j]*i%mod*(m-j)%mod*C(n*m-i*j-1,i-1)%mod*fac[i-1]%mod);
		}
	printf("%d\n",ans);
	return 0;
}
/*
100 100 998244353
*/