#include <bits/stdc++.h>
#define REP(i, l, r) for (int i = (l); i <= (r); ++ i)
#define DEP(i, r, l) for (int i = (r); i >= (l); -- i)
#define fi first
#define se second
#define pb emplace_back
#define mems(x, v) memset((x), (v), sizeof(x))
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(), (x).end()
using namespace std;
namespace math {
	typedef long long LL;
	template <class T> T qpow(T a, LL b) { if (!b) return {1}; T rs = a; b --; for (; b; b >>= 1, a = a * a) if (b & 1) rs = rs * a; return rs; }
	LL mul(LL a, LL b, LL p) { LL rs = a * b - LL(1.L * a * b / p) * p; rs %= p; if (rs < 0) rs += p; return rs; }
	template <unsigned P = 0> struct mint {
		unsigned v; static unsigned mod; mint() = default;
		template <class T> mint(T x) { x %= getmod(), v = x < 0 ? x + getmod() : x; }
		static int getmod() { if (P > 0) return P; else return mod; }
		static void setmod(unsigned m) { mod = m; }
		mint operator + () const { return *this; }
		mint operator - () const { return mint(0) - *this; }
		mint inv() const { return assert(v), qpow(*this, getmod() - 2); }
		int val() const { return v; }
		mint &operator += (const mint &q) { if (v += q.v, v >= getmod()) v -= getmod(); return *this; }
		mint &operator -= (const mint &q) { if (v -= q.v, v >= getmod()) v += getmod(); return *this; }
		mint &operator *= (const mint &q) { v = 1ull * v * q.v % getmod(); return *this; }
		mint &operator /= (const mint &q) { return *this *= q.inv(); }
		friend mint operator + (mint p, const mint &q) { return p += q; }
		friend mint operator - (mint p, const mint &q) { return p -= q; }
		friend mint operator * (mint p, const mint &q) { return p *= q; }
		friend mint operator / (mint p, const mint &q) { return p /= q; }
		friend bool operator == (const mint &p, const mint &q) { return p.v == q.v; }
		friend bool operator != (const mint &p, const mint &q) { return p.v != q.v; }
		friend bool operator < (const mint &p, const mint &q) { return p.v < q.v; }
		friend bool operator > (const mint &p, const mint &q) { return p.v > q.v; }
		friend bool operator <= (const mint &p, const mint &q) { return p.v <= q.v; }
		friend bool operator >= (const mint &p, const mint &q) { return p.v >= q.v; }
		friend istream &operator >> (istream &is, mint &a) { is >> a.v; return is; }
		friend ostream &operator << (ostream &os, const mint &a) { os << a.v; return os; }
	};
	template <> unsigned mint<0>::mod = 998244353;
}
namespace Milkcat {
	typedef long long LL;
	typedef pair<LL, LL> pii;
	const int N = 155;
	typedef math::mint<> MI;
	int n, m, mod; MI fac[N], C[N][N], f[N][N][N];
	int main() {
		cin >> n >> m >> mod, MI::setmod(mod);
		if (m >= n) { cout << "0\n"; return 0; }
		fac[0] = C[0][0] = f[0][1][0] = 1;
		REP(i, 1, n) {
			C[i][0] = 1, fac[i] = fac[i - 1] * i;
			REP(j, 1, i) C[i][j] = C[i - 1][j] + C[i - 1][j - 1];
		}
		REP(i, 1, m) REP(j, 1, n) REP(k, 0, j) {
			if (f[i - 1][j][k] == 0) continue;
			REP(x, 0, k - 1) f[i][j][x] += f[i - 1][j][k] * C[k][x];
			REP(x, 1, n - j) f[i][j + x][k + x - 1] += f[i - 1][j][k] * j;
		}
		cout << f[m][n][0] * fac[n] << '\n';
		return 0;
	}
}
int main() {
	// freopen("c.in", "r", stdin);
	// freopen("c.out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	int T = 1;
	while (T --) Milkcat::main();
	return 0;
}