/*
去逃避
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
int mod,n,v;
int qp(int p,int q){
	int ans =1,pro = p;
	while(q){
		if(q&1)ans = ans*pro%mod;
		pro = pro*pro%mod;q>>=1;
	}
	return ans;
}
int dp[155][155][155],f[155][155];
int jie[10005],inv[10005];
int CC[1005][1005];
int C(int n,int m){if(n<m or m<0)return 0;return CC[n][m];}
signed main(){
	
	cin >> n >> v >> mod;
	CC[0][0]=1;
	for(int i = 1;i<=1000;i++){
		CC[i][0]=CC[i][i]=1;
		for(int j = 1;j<i;j++)CC[i][j] = (CC[i-1][j]+CC[i-1][j-1])%mod;
	}
	if(v>n){cout << 0 << endl;return 0;}
	dp[0][1][0] = 1;
	for(int i = 1;i<=v;i++){
		memset(f,0,sizeof(f));
		for(int j = 0;j<=n;j++){
			for(int l =0;l<=n;l++){
				if(!dp[i-1][j][l])continue;
				for(int k = 0;k+j+l<=n;k++){
					if(!k){
						f[j+k][l] = (f[j+k][l]+dp[i-1][j][l])%mod;
						continue;
					}
					//在树边上加入 k 个点
	//				cout << " " << C(j+l-1+(k-1),k) << endl;
					f[j+k][l] = (f[j+k][l]+dp[i-1][j][l]%mod*C(j+l-1+(k-1),k))%mod;
				}
			}
		}
		//在虚点上插入 k 个点
		for(int j =0;j<=n;j++){
			for(int l=0;l<=n;l++){
				if(!f[j][l])continue;
				for(int k =0;k<=l;k++){
					if(!k){
						dp[i][j][l] = (dp[i][j][l]+f[j][l])%mod;
						continue;
					}
					dp[i][j+k][l-k] = (dp[i][j+k][l-k]+f[j][l]%mod*C(l,k))%mod;
				}
			}
		}
		//什么都没选减掉
		for(int j =0;j<=n;j++)for(int l =0;l<=n;l++){
			if(!dp[i-1][j][l])continue;
			dp[i][j][l] = (dp[i][j][l]-dp[i-1][j][l]+mod)%mod;
			//边上挂一个
			dp[i][j+1][l+1] = (dp[i][j+1][l+1]+dp[i-1][j][l]*(j+l-1))%mod;
			//点上挂一个
			dp[i][j+1][l] = (dp[i][j+1][l]+dp[i-1][j][l]*(j+l))%mod;
		}
	//	for(int j =0;j<=n;j++){
	//		for(int l =0;l<=n;l++){
	//			cout << dp[i][j][l] << " ";
	//		}
	///		cout << endl;
	//	}
	//	cout << "---------" << endl;
	}
	int ans = dp[v][n][0];
	for(int i = 1;i<=n;i++)ans = ans*i%mod;
	cout << ans << endl;
	return 0;
}/*
5 3 998244353
*/