#include <bits/stdc++.h>
using namespace std;
long long n, d, P, inv[15], f[1100][15][1100];
long long C(long long n, long long m) {
  long long res = 1;
  for (long long i = n; i > n - m; i--) res = res * i % P;
  for (long long j = 1; j <= m; j++) res = res * inv[j] % P;
  return res;
}
signed main() {
  scanf("%lld %lld %lld", &n, &d, &P);
  if (n <= 2) return puts("1"), 0;
  inv[1] = 1;
  for (long long i = 2; i <= d; i++) inv[i] = (P - P / i) * inv[P % i] % P;
  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(d, i - 1); j++)
      for (long long k = 1; k <= n; k++) {
        f[i][j][k] = f[i][j][k - 1];
        for (long long t = 1; t <= j && k * t <= i; t++) {
          if (k == 1)
            (f[i][j][k] +=
             f[i - t * k][j - t][k - 1] * C(f[k][0][k - 1] + t - 1, t)) %= P;
          else
            (f[i][j][k] += f[i - t * k][j - t][k - 1] *
                           C(f[k][d - 1][k - 1] + t - 1, t)) %= P;
        }
      }
  if (n & 1)
    printf("%lld\n", f[n][d][n / 2]);
  else
    printf("%lld\n",
           (f[n][d][n / 2] - C(f[n / 2][d - 1][n / 2 - 1], 2) + P) % P);
  return 0;
}
