#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) ((int) (v).size())
#define me(f, x) memset(f, x, sizeof(f))
#define mc(f, g) memcpy(f, g, sizeof(f))
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

constexpr int N = 155;
int n, m, P;

IL constexpr int qpow (int b, int k = P - 2) {
  int r = 1;
  for (; k; k >>= 1, b = (LL)b * b % P) if (k & 1) r = (LL)r * b % P;
  return r;
}

int fc[N], ifc[N], C[N][N];

void init (int Z) {
  fc[0] = 1;
  L (i, 1, Z) {
    fc[i] = (LL)fc[i - 1] * i % P;
  }
  ifc[Z] = qpow(fc[Z]);
  R (i, Z - 1, 0) {
    ifc[i] = (LL)ifc[i + 1] * (i + 1) % P;
  }
  L (i, 0, Z) {
    C[i][0] = 1;
    L (j, 1, i) {
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % P;
    }
  }
}

int dp[N][N], _dp[N][N];

void pls (int &x, const LL &y) {
  x = (x + y) % P;
}

int main () {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n >> m >> P;
  if (m >= n) {
    cout << "0\n";
    return 0;
  }
  init(n);
  dp[1][0] = n;
  L (c, 1, m) {
    me(_dp, 0);
    L (i, 1, n - 1) {
      L (j, 0, n - i) {
        int x = dp[i][j];
        if (x) {
          L (k, 1, n - i - j) {
            pls(_dp[i + 1][j + k - 1], (LL)x * (n - i) % P * (i + j));
          }
          L (k, 1, j) {
            pls(_dp[i + k][j - k], (LL)x * C[n - i][k] % P * C[j][k] % P * fc[k]);
          }
        }
      }
    }
    mc(dp, _dp);
  }
  cout << dp[n][0] << '\n';
}
// I love WHQ!