func_code_string: #include <bits/stdc++.h>   using namespace std;   const int maxn = 1005, maxd = 15;   int f[maxn], g[maxn][maxd][maxn], rfac[maxn], n, d, mo;   int pow(int a, int b) {     int tmp = 1;     for (; b; b >>= 1, a = a * 1ll * a % mo)       if (b & 1) tmp = tmp * 1ll * a % mo;     return tmp;   }   int main() {     cin >> n >> d >> mo;     if (n == 1) {       cout << 1 << endl;       return 0;     }     rfac[0] = 1;     for (int i = 1; i <= 1000; i++)       rfac[i] = rfac[i - 1] * 1ll * pow(i, mo - 2) % mo;     for (int i = 0; i <= n; i++) g[0][0][i] = 1;     for (int i = 1; i <= n; i++) {       if (i != 1)         f[i] = g[i - 1][d - 1][n];       else         f[i] = 1;       for (int dd = 1; dd <= d; dd++) {         for (int x = 1; x <= i; x++) {           int v = f[x];           for (int k = 1, cv = 1; k <= dd && x * k <= i; k++) {             cv = cv * 1ll * (v + k - 1) % mo;             g[i][dd][x] = (g[i][dd][x] + g[i - x * k][dd - k][x - 1] * 1ll * cv %                                              mo * rfac[k] % mo) %                           mo;           }         }         for (int x = 1; x <= n; x++)           g[i][dd][x] = (g[i][dd][x] + g[i][dd][x - 1]) % mo;       }     }     int ans = g[n - 1][d][(n - 1) / 2];     if (!(n & 1)) {       int v = f[n / 2];       ans = (ans + v * 1ll * (v + 1) % mo * rfac[2] % mo) % mo;     }     cout << ans << endl;   }   