#include <bits/stdc++.h>
using namespace std;
int n, v, M, C[160][160], fcn;
int f[160][160][160];//weight<=i,block sz = j,cnt >i = k
//ignore label 1~n,ans mul n!
int add(int x, int y){x += y;return x >= M? x - M : x;}
int mul(int x, int y){return static_cast<long long>(x) * y % M;}
void sadd(int &x, int y){x = add(x, y);}
int main(){
    //freopen("c.in", "r", stdin);freopen("c.out", "w", stdout);
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    cin >> n >> v >> M;if (n <= v)return cout << 0 << endl, 0;
    for (int i = 0; i <= n; fcn = i++? i <= n? mul(fcn, i) : fcn : 1)
        for (int j = C[i][0] = 1; j <= i; ++j)C[i][j] = add(C[i - 1][j - 1], C[i - 1][j]);
    f[0][1][0] = 1;//must have weight 0
    for (int i = 0; i < v; ++i)
        for (int j = 1; j <= n; ++j)
            for (int k = 0; k <= j; ++k)
                if (f[i][j][k]){
                    for (int l = 1; l <= k; ++l)//fill `l` pts with i+1
                        sadd(f[i + 1][j][k - l/*used l poses*/], mul(f[i][j][k], C[k][l]/*choose poses of l pts*/));
                    for (int l = 1; j + l <= n; ++l)//add a list,length=l,include pts i+1
                        sadd(f[i + 1][j + l][k + l - 1], mul(f[i][j][k], j/*choose list's begin*/));
                }
    cout << mul(f[v][n][0], fcn/*n! choices of label*/) << endl;
    return 0;
}
/*
5 3 998244353

2280


10 6 998244353

730523983


43 21 10091121

1515927


110 75 81670423

66351113
*/