#include <bits/stdc++.h>
#define ll long long
#define pii pair <int, int>
#define fi first
#define se second
#define pb push_back

using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 155;
int n, V, mod;
ll f[N][N][N], c[N][N], fac[N];
ll qpow (ll x, ll y = mod-2) {
	ll res = 1;
	while (y) {
		if (y&1) res = res*x%mod;
		x = x*x%mod; y >>= 1;
	}
	return res;
}

signed main () {
	cin >> n >> V >> mod;
	if (V >= n) {
		cout << 0; return 0;
	}
	c[0][0] = 1; fac[0] = 1;
	for (int i = 1;i <= n;i++) {
		c[i][0] = 1; fac[i] = fac[i-1]*i%mod;
		for (int j = 1;j <= i;j++) c[i][j] = (c[i-1][j]+c[i-1][j-1])%mod;
	}
	f[0][0][1] = 1;
	for (int i = 0;i < V;i++) {
		for (int j = 0;j <= n;j++) {
			for (int z = 1;z <= n;z++) {
//				if (f[i][j][z]) cout << i <<" " << j << " " << z << " " << f[i][j][z] << endl;
				for (int p = 0;p+z+1 <= n;p++) (f[i+1][j+p][z+p+1] += z*f[i][j][z]) %= mod;
				for (int p = 1;p <= j;p++) (f[i+1][j-p][z] += f[i][j][z]*c[j][p]) %= mod;
			}
		}
	}
	cout << f[V][0][n]*fac[n]%mod;
	return 0;
}