#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int N = 155;
int n, v, mod, C[N][N], f[N][N][N];

ll quick_pow(ll x, int y){
	ll res = 1;
	while(y){
		if(y & 1) res = res * x % mod;
		x = x * x % mod;
		y >>= 1;
	}
	return res;
}

void pre(){
	for(int i = 0; i <= n; ++i){
		C[i][0] = 1;
		for(int j = 1; j <= i; ++j) C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
	}
	return;
}

int main()
{
	cin >> n >> v >> mod;
	pre();
	if(v >= n){
		putchar('0');
		return 0;
	}
	for(int i = 2; i <= n; ++i) f[1][i][2] = 1;
	for(int i = 1; i < v; ++i){
		// #1
		for(int j = i + 1; j <= n; ++j)
			for(int k = 1; k <= j; ++k)
				for(int l = 0; j + l + 1 <= n; ++l) (f[i + 1][j + l + 1][k + 1] += 1ll * f[i][j][k] * j % mod) %= mod;
		// #2
		for(int j = i + 1; j <= n; ++j)
			for(int k = 1; k <= j; ++k)
				for(int l = 1; k + l <= j; ++l) (f[i + 1][j][k + l] += 1ll * f[i][j][k] * C[j - k][l] % mod) %= mod;
	}
	for(int i = 1; i <= n; ++i) f[v][n][n] = 1ll * f[v][n][n] * i % mod;
	cout << f[v][n][n] << '\n';
	return 0;
}