#include <bits/stdc++.h>
using namespace std;
long long n, d, mod, ans, f[20], g[20], dp[1010][20][1010];
inline long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 3) + (x << 1) + (c ^ '0');
    c = getchar();
  }
  return x * f;
}
long long Pow(long long x, long long k) {
  long long res = mod != 1;
  x %= mod;
  while (k) {
    if (k & 1) res = res * x % mod;
    x = x * x % mod;
    k >>= 1;
  }
  return res;
}
long long C(long long n, long long m) {
  if (n < m) return 0;
  long long res = 1;
  for (long long i = 1; i <= m; i++) res = res * (n - i + 1) % mod;
  return res * g[m] % mod;
}
int main() {
  n = read();
  d = read();
  mod = read();
  f[0] = g[0] = 1;
  for (long long i = 1; i <= 10; i++) f[i] = f[i - 1] * i % mod;
  g[10] = Pow(f[10], mod - 2);
  for (long long i = 9; i; i--) g[i] = g[i + 1] * (i + 1) % mod;
  if (n <= 2) {
    puts("1");
    return 0;
  }
  for (long long i = 0; i <= n; i++) dp[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++) {
        dp[i][j][k] = dp[i][j][k - 1];
        for (long long t = 1; i - t * k > 0 && j - t >= 0; t++) {
          if (k != 1)
            dp[i][j][k] =
                (dp[i][j][k] + dp[i - t * k][j - t][k - 1] *
                                   C(dp[k][d - 1][k - 1] + t - 1, t) % mod) %
                mod;
          else
            dp[i][j][k] =
                (dp[i][j][k] + dp[i - t * k][j - t][k - 1] *
                                   C(dp[k][0][k - 1] + t - 1, t) % mod) %
                mod;
        }
      }
  if (n & 1)
    ans = dp[n][d][n / 2];
  else
    ans = (dp[n][d][n / 2] - C(dp[n / 2][d - 1][n / 2 - 1], 2) + mod) % mod;
  printf("%lld", ans);
  return 0;
}
