#include <bits/stdc++.h>
using namespace std;
int read() {
    int x = 0, f = 1; char c = getchar();
    while (c < '0' || c > '9') {if (c == '-') f = -f; c = getchar();}
    while (c >= '0' && c <= '9') {x = x * 10 + (c ^ 48); c = getchar();}
    return x * f;
}
const int N = 155;
int n, V, mod;
int C[N][N], f[N][N][N], g[N][N][3], fac[N], t[N][N];
void Solve() {
    n = read(); V = read(); mod = read();
    if (V >= n) return void(puts("0"));
    f[0][1][0] = C[0][0] = fac[0] = 1;
    for (int i = 1; i <= n; i++) fac[i] = 1LL * fac[i - 1] * i % mod;
    for (int i = 1; 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]) % mod;
    }
    for (int i = 0; i <= n; i++) {
        t[i][0] = 1;
        for (int j = 1; j <= n; j++) t[i][j] = 1LL * t[i][j - 1] * (i + j - 1) % mod;
    }
    for (int i = 0; i < V; i++) {
        for (int j = 0; j <= n; j++)
            for (int k = 0; j + k <= n; k++)
                g[j][k][0] = g[j][k][1] = g[j][k][2] = 0;
        for (int j = 1; j <= n; j++)
            for (int k = 0; j + k <= n; k++)
                for (int c = 0; j + k + c <= n; c++)
                    g[j + c][k][min(c, 2)] = (g[j + c][k][min(c, 2)] + 1LL * f[i][j][k] * C[j + c][c] % mod * t[j + k - 1][c]) % mod;
        for (int j = 1; j <= n; j++)
            for (int k = 0; j + k <= n; k++)
                for (int c = 0; c <= k; c++) {
                    int s = g[j][k][2]; if (c) s = (s + g[j][k][1]) % mod; if (c > 1) s = (s + g[j][k][0]) % mod;
                    f[i + 1][j + c][k - c] = (f[i + 1][j + c][k - c] + 1LL * s * C[k][c] % mod * fac[c] % mod * C[j + c][c]) % mod;
                }
        for (int j = 1; j <= n; j++)
            for (int k = 0; j + k <= n; k++) {
                f[i + 1][j + 1][k] = (f[i + 1][j + 1][k] + 1LL * f[i][j][k] * (j + k + j + k - 1) * (j + 1)) % mod;
                f[i + 1][j + 1][k + 1] = (f[i + 1][j + 1][k + 1] + 1LL * f[i][j][k] * (j + k - 1) * (j + 1)) % mod;
                if (k) f[i + 1][j + 1][k - 1] = (f[i + 1][j + 1][k - 1] + 1LL * f[i][j][k] * k * (j + 1)) % mod;
            }
    }
    printf("%d\n", f[V][n][0]);
}
int main() {
    // freopen(".in", "r", stdin);
    // freopen(".out", "w", stdout);
    int _ = 1;
    while (_--) Solve();
    return 0;
}