#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
const int N = 155;
int n, m, mod, C[N][N], f[N][N][N], fcn;
inline void add(int& x, int y){x += y;if (x >= mod) x -= mod;}
inline void mul(int& x, int y){x = 1ll * x * y % mod;}
int main(){scanf("%d%d%d", &n, &m, &mod), fcn = 1;
	if (m >= n){printf("0");return 0;}
	for (int i = 1;i <= n;i ++) mul(fcn, i);
	f[0][1][0] = fcn;
	for (int i = 0;i <= n;i ++){C[i][0] = 1;
	for (int j = 1;j <= i;j ++) add(C[i][j] = C[i - 1][j], C[i - 1][j - 1]);}
	for (int i = 1;i <= m;i ++)
	for (int j = i;j <= n;j ++)
	for (int k = 0;k <= j - i;k ++){
		for (int c = 1;k + c <= j;c ++)
		add(f[i][j][k], 1ll * f[i - 1][j][k + c] * C[k + c][c] % mod);
		for (int c = 1;c <= j && c < k + 2;c ++)
		add(f[i][j][k], 1ll * (j - c) * f[i - 1][j - c][k - c + 1] % mod);
	}printf("%d", f[m][n][0]);
}