#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) fprintf(stderr, ##__VA_ARGS__)
#else
#define endl "\n"
#define debug(...) void(0)
#endif
using LL = long long;
template <int id>
struct modint {// {{{
  static int mod;
  static unsigned umod() { return mod; }
  unsigned v;
  modint() = default;
  template <class T, std::enable_if_t<std::is_integral<T>::value, int> = 0>
  modint(const T &_y)
      : v((unsigned)(_y % mod + (std::is_signed<T>() && _y < 0 ? mod : 0))) {}
  friend int raw(const modint &self) { return self.v; }
  friend std::ostream &operator<<(std::ostream &os, const modint &self) {
    return os << raw(self);
  }
  modint &operator+=(const modint &rhs) {
    v += rhs.v;
    if (v >= umod()) v -= umod();
    return *this;
  }
  modint &operator-=(const modint &rhs) {
    v -= rhs.v;
    if (v >= umod()) v += umod();
    return *this;
  }
  modint &operator*=(const modint &rhs) {
    v = (unsigned)(1ull * v * rhs.v % umod());
    return *this;
  }
  static int inverse(int a, int b) {
    assert(a);
    return a == 1 ? 1 : b - 1ll * inverse(b % a, a) * b / a;
  }
  modint &operator/=(const modint &rhs) {
    return *this *= inverse(rhs.v, mod);
  }
  friend modint qpow(modint a, LL b) {
    if (b < 0) b = -b, a = 1 / a;
    modint r = 1;
    for (; b; b >>= 1, a *= a)
      if (b & 1) r *= a;
    return r;
  }
  friend modint operator+(modint lhs, const modint &rhs) { return lhs += rhs; }
  friend modint operator-(modint lhs, const modint &rhs) { return lhs -= rhs; }
  friend modint operator*(modint lhs, const modint &rhs) { return lhs *= rhs; }
  friend modint operator/(modint lhs, const modint &rhs) { return lhs /= rhs; }
  friend bool operator==(const modint &lhs, const modint &rhs) {
    return lhs.v == rhs.v;
  }
  friend bool operator!=(const modint &lhs, const modint &rhs) {
    return lhs.v != rhs.v;
  }
  explicit operator bool() const { return v != 0; }
};// }}}
template <int id> int modint<id>::mod;
using mint = modint<-1>;
int N, V;
mint f[210][210][210], fac[210], binom[210][210];
int main() {
#ifndef LOCAL
  cin.tie(nullptr)->sync_with_stdio(false);
#endif
  cin >> N >> V >> mint::mod;
  if (V >= N) return cout << 0 << endl, 0;
  fac[0] = 1;
  for (int i = 1; i <= N; i++) fac[i] = fac[i - 1] * i;
  for (int i = 0; i <= N; i++) {
    binom[i][0] = 1;
    for (int j = 1; j <= i; j++) binom[i][j] = binom[i - 1][j] + binom[i - 1][j - 1];
  }
  f[0][1][0] = 1;
  for (int v = 1; v <= V; v++) {
    for (int i = 1; i <= N; i++) {
      for (int c = 0; c <= i; c++) {
        // f[v - 1][i][c]
        for (int d = 1; d <= c; d++) {
          f[v][i][c - d] += f[v - 1][i][c] * binom[c][d];
        }
        for (int d = 1; d <= N - i; d++) {
          f[v][i + d][c + d - 1] += f[v - 1][i][c] * binom[i + d][d] * fac[d] * i;
        }
      }
    }
  }
  for (int v = 0; v <= V; v++) {
    for (int i = 1; i <= N; i++) {
      for (int c = 0; c <= i; c++) {
        if (f[v][i][c]) debug("f[%d][%d][%d] = %d\n", v, i, c, raw(f[v][i][c]));
      }
    }
  }
  cout << f[V][N][0] << endl;
  return 0;
}