#include <bits/stdc++.h>
using namespace std;
const int N = 203;
unsigned n, d, mod, f[N][N], dp[N], C[N][N], ans;
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> d >> mod;
  f[1][0] = dp[1] = 1;
  if (mod == 1 || (d == 1 && n > 2)) {
    puts("0");
    return 0;
  }
  for (unsigned i = 0; i <= n; ++i)
    for (unsigned j = *C[i] = 1; j <= i; ++j)
      C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % mod;
  for (unsigned i = 2; i <= n; ++i) {
    for (unsigned j = 1; j < i; ++j)
      for (unsigned k = 1; k < i; ++k)
        f[i][j] = (f[i][j] +
                   (long long)f[i - k][j - 1] * dp[k] % mod * C[i - 2][k - 1]) %
                  mod;
    for (unsigned j = 0; j < d; ++j) dp[i] = (dp[i] + f[i][j]) % mod;
  }
  for (unsigned i = 1; i <= n; ++i)
    for (unsigned j = 0; j <= d; ++j)
      for (unsigned k = 0; j + k <= d; ++k)
        ans = (ans + (long long)f[i][j] * f[n + 1 - i][k]) % mod;
  for (unsigned i = 1; i < n; ++i)
    ans = (ans + mod - (long long)dp[i] * dp[n - i] % mod) % mod;
  printf("%lld\n", ans * 2 * (n - 1ll) % mod * n % mod);
}
