#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 300;
int n, V, P;
ll f[155][155][155], t[155][155], c[305][305];
ll C(int n, int m) {
	if (n == m) return 1;
	if (m < 0) return 0;
	return c[n][m];
}
int main() {
	scanf("%d%d%d", &n, &V, &P);
	if (V >= n) return puts("0"), 0;
	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] + c[i - 1][j - 1]) % P;
	}
	f[0][1][0] = 1;
	for (int i = 0; i < V; i++) {
		memset(t, 0, sizeof(t));
		for (int j = 1; j <= n; j++) {
			for (int k = 0; k <= j; k++) {
				for (int x = 0; j + x <= n; x++) {
					(t[j + x][k] += f[i][j][k] * C(x + j - 2, j - 2) % P) %= P;
				}
			}
		}
		for (int j = 1; j <= n; j++) {
			for (int k = 0; k <= j; k++) {
				for (int y = 0; y <= k; y++) {
					(f[i + 1][j][k - y] += t[j][k] * c[k][y] % P) %= P;
				}
			}
		}
		for (int j = 1; j <= n; j++) {
			for (int k = 0; k <= j; k++) {
				(f[i + 1][j][k] += P - f[i][j][k]) %= P;
				(f[i + 1][j + 1][k] += f[i][j][k] * j % P) %= P;
				(f[i + 1][j + 2][k + 1] += f[i][j][k] * (j - 1) % P) %= P;
			}
		}
	}
	ll ans = f[V][n][0];
	for (int i = 1; i <= n; i++) ans = ans * i % P;
	printf("%lld\n", ans);
	return 0;
}