#include <bits/stdc++.h>
using namespace std;
int n, d;
long long mod, dp[1005][25][1005], f[1005], g[1005], ans;
long long Pow(long long a, long long b) {
  long long rec = 1;
  for (; b; b >>= 1, a = a * a % mod)
    if (b & 1) rec = a * rec % mod;
  return rec;
}
int C(int n, int m) {
  if (n < m) return 0;
  long long ans = 1;
  for (int i = 1; i <= m; i++) ans = ans * (long long)(n - i + 1) % mod;
  return ans * g[m] % mod;
}
int main() {
  scanf("%d%d%lld", &n, &d, &mod);
  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);
  for (int i = n - 1; i; i--) g[i] = g[i + 1] * (i + 1) % mod;
  if (n <= 2) return puts("1"), 0;
  for (int i = 0; i <= n; i++) dp[1][0][i] = 1;
  for (int i = 2; i <= n; i++)
    for (int j = 1; j <= min(i - 1, d); j++)
      for (int k = 1; k <= n; k++) {
        dp[i][j][k] = dp[i][j][k - 1];
        for (int 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;
          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\n", ans);
}
