#include<iostream>
#include<cstdio>
#define N 150
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,V,mod,fac[N+1],C[N+1][N+1],dp[N+1][N+1][N+1];
void Adder(int &x,int d)
{
	x=x+d>=mod?x+d-mod:x+d;
	return;
}
void Adder2(int &x,int d)
{
	x=x+d<0?x+d+mod:x+d;
	return;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int main()
{
	n=read(),V=read(),mod=read(),fac[0]=1;
	if (V+1>n)
	{
		puts("0");
		return 0;
	}
	for (int i=1;i<=n;++i) fac[i]=1ll*fac[i-1]*i%mod;
	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]=MD(C[i-1][j-1]+C[i-1][j]);
	dp[0][1][0]=1;
	for (int i=1;i<=V;++i)
		for (int j=0;j<=n;++j)
			for (int k=0;k<=j;++k)
			{
				for (int t=k+1;t<=n;++t) Adder(dp[i][j][k],1ll*dp[i-1][j][t]*C[t][k]%mod);
				for (int t=1;t<=n-j;++t) Adder(dp[i][j+t][k+t-1],1ll*dp[i-1][j][k]*j%mod);
			}
	printf("%lld\n",1ll*dp[V][n][0]*fac[n]%mod);
	return 0;
}