#include <bits/stdc++.h>
using namespace std;
const int N = 211;
int n, K, mod, ans, g[N], f[N][N], C[N][N];
inline void reduce(int& x) { x += x >> 31 & mod; }
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> K >> mod;
  for (int i = 0; i <= n; ++i) {
    C[i][0] = 1;
    for (int j = 1; j <= i; ++j)
      reduce(C[i][j] = C[i - 1][j] - mod + C[i - 1][j - 1]);
  }
  f[1][0] = 1;
  g[1] = 1;
  for (int i = 2; i <= n; ++i)
    for (int j = 1; j <= K; ++j) {
      for (int k = 1; k < i; ++k)
        f[i][j] = (f[i][j] +
                   (long long)f[k][j - 1] * g[i - k] % mod * C[i - 2][k - 1]) %
                  mod;
      if (j != K) reduce(g[i] += f[i][j] - mod);
    }
  for (int i = 1; i <= n; ++i)
    for (int j = 0; j <= K; ++j)
      if (j != 1)
        for (int k = 0; k <= K - j; ++k)
          ans = (ans + (long long)f[i][j] * f[n + 1 - i][k]) % mod;
  ans = (long long)2 * n * (n - 1) % mod * ans % mod;
  cout << ans << '\n';
  return 0;
}
