#include <bits/stdc++.h>

using namespace std;

const int N = 155;

int fac[N], C[N][N], f[N][N][N];

signed main() {
    int n, m, P; scanf("%d%d%d", &n, &m, &P);
    if (m >= n) return 0 & puts("0");
    for (int i = C[0][0] = fac[0] = 1; i <= n; ++i) {
        fac[i] = 1ll * fac[i - 1] * i % P;
        for (int j = C[i][0] = 1; j <= i; ++j) {
            C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % P;
        }
    }
    f[0][1][0] = 1;
    auto add = [&](int &x, long long y) {
        x = (x + y) % P;
    };
    for (int i = 0; i < m; ++i) {
        for (int j = 1; j <= n; ++j) {
            for (int k = 0; k < j; ++k) {
                if (!f[i][j][k]) continue;
                for (int l = 1; l <= k; ++l) {
                    add(f[i + 1][j][k - l], 1ll * f[i][j][k] * C[k][l]);
                }
                for (int l = 0; l <= n - j - 1; ++l) {
                    add(f[i + 1][j + l + 1][k + l], 1ll * f[i][j][k] * j);
                }
            }
        }
    }
    printf("%lld\n", 1ll * f[m][n][0] * fac[n] % P);
    return 0;
}