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

typedef long long ll;

ll mod, A[155][155], C[155][155];
ll f[2][155][155], g[155][155];

int main()
{
	ios::sync_with_stdio(false), cin.tie(0);
	
	int n, v;
	cin >> n >> v >> mod;
	for (int i = 0; i <= n; i++)
	{
		A[i][0] = C[i][0] = C[i][i] = 1;
		for (int j = 1; j <= i; j++) A[i][j] = A[i][j - 1] * (i - j + 1) % mod;
		for (int j = 1; j < i; j++) C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
	}
	if (v + 1 > n) return cout << "0", 0;
	
	f[0][1][0] = 1; bool p = 0;
	for (int i = 1; i <= v; i++, p ^= 1)
	{
		memset(f[p ^ 1], 0, sizeof(f[p ^ 1]));
		memset(g, 0, sizeof(g));
		for (int j = i; j <= n; j++)
			for (int k = 0; k <= n - j; k++)
				for (int l = 0; l <= k; l++)
					(g[j + l][k - l] += f[p][j][k] * C[k][l] % mod * A[j + l][l]) %= mod;
		for (int j = i; j <= n; j++)
			for (int k = 0; k <= n - j; k++)
			{
				for (int l = 0; l <= n - j - k; l++)
					(f[p ^ 1][j + l][k] += g[j][k] * C[j + l][l] % mod * A[j + k + l - 2][l]) %= mod;
                if (j + k >= 2) (f[p ^ 1][j][k] += mod - f[p][j][k]) %= mod;
				(f[p ^ 1][j][k] += f[p][j - 1][k] * (j + k - 1) * j) %= mod;
				if (k && j + k > 3) (f[p ^ 1][j][k] += f[p][j - 1][k - 1] * (j + k - 3) * j) %= mod;
			}
	}
	cout << f[p][n][0];
	return 0;
}