#include <bits/stdc++.h>
using namespace std;
const long long maxn = 1e3 + 7;
const long long maxm = 20;
long long read() {
  long long res = 0, f = 1;
  char c = getchar();
  while (!isdigit(c) && c != '-') c = getchar();
  if (c == '-') f = -1, c = getchar();
  while (isdigit(c)) res = (res << 1) + (res << 3) + c - 48, c = getchar();
  return res * f;
}
long long n, d, mod;
long long f[maxn][maxm][maxn];
long long pow(long long x, long long n, long long mod) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % mod;
    x = x * x % mod;
    n >>= 1;
  }
  return res;
}
long long F[maxn], g[maxn];
long long C(long long n, long long m) {
  if (n < m) return 0;
  int ans = 1;
  for (int i = 1; i <= m; i++) ans = ans * (n - i + 1) % mod;
  return ans * g[m] % mod;
}
void init() {
  int n = 10;
  F[0] = g[0] = 1;
  for (int i = 1; i <= n; i++) F[i] = F[i - 1] * i % mod;
  g[n] = pow(F[n], mod - 2, mod);
  for (int i = n - 1; i; i--) g[i] = g[i + 1] * (i + 1) % mod;
}
int main() {
  n = read(), d = read(), mod = read();
  init();
  if (n <= 2) {
    puts("1");
    return 0;
  }
  for (long long i = 0; i <= n; i++) f[1][0][i] = 1;
  for (long long i = 2; i <= n; i++) {
    for (long long j = 1; j <= min(i - 1, d); j++) {
      for (long long k = 1; k <= n; k++) {
        f[i][j][k] = f[i][j][k - 1];
        for (long long t = 1; i - t * k > 0 && j - t >= 0; t++) {
          if (k != 1)
            f[i][j][k] =
                (f[i][j][k] + f[i - t * k][j - t][k - 1] *
                                  C(f[k][d - 1][k - 1] + t - 1, t) % mod) %
                mod;
          else
            f[i][j][k] = (f[i][j][k] + f[i - t * k][j - t][k - 1] *
                                           C(f[k][0][k - 1] + t - 1, t) % mod) %
                         mod;
        }
      }
    }
  }
  long long ans = f[n][d][n / 2];
  if (!(n & 1)) ans = (ans - C(f[n / 2][d - 1][n / 2 - 1], 2) + mod) % mod;
  printf("%lld\n", ans);
  return 0;
}
