#include<bits/stdc++.h>
using namespace std;
const int N=155;
struct Fastmod{
typedef unsigned long long ull;
typedef __uint128_t uLL;
ull P,m;
void init(int P){
	this->P=P,m=(uLL(1)<<64)/P;
}
ull mod(ull a){
	ull b=uLL(m)*a>>64;
	ull r=a-b*P;
	return r>=P?r-P:r;
}
}Z;
int f[N][N],C[N][N],n,V,P,ans;
int main(){
	scanf("%d%d%d",&n,&V,&P);
	if(V>=n)return puts("0"),0;
	Z.init(P);
	for(int i=0;i<=n;++i)C[i][0]=1;
	for(int i=1;i<=n;++i)for(int j=1;j<=i;++j)C[i][j]=Z.mod(C[i-1][j]+C[i-1][j-1]);
	f[1][0]=1;
	for(int t=1;t<=V;++t)
		for(int i=n;i;--i)for(int j=0;j<i;++j)if(f[i][j]){
			for(int l=0;l+i+1<=n;++l)f[i+l+1][j+l]=Z.mod(f[i+l+1][j+l]+1ull*f[i][j]*i);
			for(int l=1;l<=j;++l)f[i][j-l]=Z.mod(f[i][j-l]+1ull*f[i][j]*C[j][l]);
			f[i][j]=0;
		}
	ans=f[n][0];
	for(int i=1;i<=n;++i)ans=Z.mod(1ull*ans*i);
	printf("%d\n",ans);
	return 0;
}