#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
const long long N = 1010;
long long n, d, mod, f[N][11][N >> 1], fac[N], inv[N];
inline long long fpow(long long x, long long p) {
  long long ans = 1;
  for (; p; p >>= 1, x = x * x % mod)
    if (p & 1) ans = ans * x % mod;
  return ans;
}
inline void initfac(long long n) {
  fac[0] = 1;
  for (long long i = 1; i <= n; ++i) fac[i] = fac[i - 1] * i % mod;
  inv[n] = fpow(fac[n], mod - 2);
  for (long long i = n - 1; ~i; --i) inv[i] = inv[i + 1] * (i + 1) % mod;
}
inline long long C(long long n, long long m) {
  if (n < m) return 0;
  long long ans = 1;
  for (long long i = n; i >= n - m + 1; --i) ans = ans * i % mod;
  return ans * inv[m] % mod;
}
signed main() {
  n = read();
  d = read();
  mod = read();
  if (n <= 2) return puts("1") & 0;
  initfac(N - 10);
  for (long long i = 0; i <= n / 2; ++i) f[1][0][i] = 1;
  f[1][d - 1][0] = 1;
  for (long long i = 2; i <= n; ++i) {
    for (long long j = 1; j <= min(d, i - 1); ++j) {
      for (long long k = 1; k <= n / 2; ++k) {
        f[i][j][k] = f[i][j][k - 1];
        for (long long l = 1; l * k <= i && l <= j; ++l) {
          f[i][j][k] =
              (f[i][j][k] + f[i - l * k][j - l][k - 1] *
                                C(f[k][d - 1][k - 1] + l - 1, l) % mod) %
              mod;
        }
      }
    }
  }
  if (n & 1) return printf("%lld", f[n][d][n / 2]) & 0;
  return printf(
             "%lld",
             (f[n][d][n / 2] - C(f[n / 2][d - 1][n / 2 - 1], 2) + mod) % mod) &
         0;
}
