#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void in(T &x) {
  x = 0;
  short f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = x * 10 + (c ^ '0'), c = getchar();
  x *= f;
}
template <class T>
inline void out(T x, const char c = '\n') {
  static short st[30];
  short m = 0;
  if (x < 0) putchar('-'), x = -x;
  do st[++m] = x % 10, x /= 10;
  while (x);
  while (m) putchar(st[m--] | '0');
  putchar(c);
}
template <class T, class... Args>
inline void in(T &x, Args &...args) {
  in(x);
  in(args...);
}
template <class T, class... Args>
inline void out(const T &x, const Args &...args) {
  out(x, ' ');
  out(args...);
}
template <class T>
inline void prt(T a[], int n) {
  for (register int i = 0; i < n; ++i) out(a[i], ' ');
  putchar('\n');
}
template <class T>
inline void clr(T a[], int n) {
  memset(a, 0, sizeof(T) * n);
}
template <class T>
inline void clr(T *a, T *b) {
  memset(a, 0, sizeof(T) * (b - a));
}
template <class T>
inline bool ckmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
template <class T>
inline bool ckmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
namespace MOD_CALC {
int md;
inline int add(const int a, const int b) {
  return a + b >= md ? a + b - md : a + b;
}
inline int sub(const int a, const int b) {
  return a - b < 0 ? a - b + md : a - b;
}
inline int mul(const int a, const int b) { return (long long)a * b % md; }
inline void inc(int &a, const int b) { (a += b) >= md ? a -= md : 0; }
inline void dec(int &a, const int b) { (a -= b) < 0 ? a += md : 0; }
inline int qpow(int a, int b) {
  int r = 1;
  for (; b; b >>= 1, a = mul(a, a))
    if (b & 1) r = mul(r, a);
  return r;
}
inline int mdinv(const int a) { return qpow(a, md - 2); }
}  // namespace MOD_CALC
using namespace MOD_CALC;
namespace i207M {
int n, d;
int f[1005][11][1005];
int g[1005][1005];
int ifac[1005];
inline int C(int n, int m) {
  if (n < m) return 0;
  int r = ifac[m];
  for (register int i = 0; i < m; ++i) r = mul(r, n - i);
  return r;
}
signed main() {
  in(n, d, md);
  if (n <= 2) {
    out(1);
    return 0;
  }
  ifac[0] = 1;
  for (register int i = 1; i <= n; ++i) ifac[i] = mul(ifac[i - 1], mdinv(i));
  f[1][0][0] = 1;
  for (register int i = 1; i <= n; ++i) g[1][i] = 1;
  for (register int i = 2; i <= n; ++i) {
    for (register int j = 1; j <= d; ++j)
      for (register int k = 1; k < i; ++k) {
        int &r = f[i][j][k];
        r = f[i][j][k - 1];
        for (register int h = 1; h <= j && h * k < i; ++h)
          inc(r, mul(f[i - h * k][j - h][min(k - 1, i - h * k - 1)], g[k][h]));
      }
    for (register int j = 1; j <= d; ++j)
      g[i][j] = C(f[i][d - 1][i - 1] + j - 1, j);
  }
  int ans = f[n][d][n / 2];
  if (~n & 1)
    dec(ans, (long long)f[n / 2][d - 1][n / 2 - 1] *
                 (f[n / 2][d - 1][n / 2 - 1] - 1) / 2 % md);
  out(ans);
  return 0;
}
}  // namespace i207M
signed main() {
  i207M::main();
  return 0;
}
