#include <bits/stdc++.h>

using namespace std;

constexpr int N = 100, S = N * N;

int mod;

auto& add(auto&& a, auto b) { return a -= (a += b) >= mod? mod: 0; }
auto& addp(auto&& a, auto b, auto c) { return a = (a + b * (uint64_t)c) % mod; }
auto& mul(auto&& a, auto... b) { return ((a = a * (uint64_t)b % mod), ...); }
int fpow(int a, int b) { int r = 1; for (; b; b /= 2, mul(a, a)) if (b % 2) mul(r, a); return r; }

int dp[N + 1][S / 2 + 1], fact[N + 1], ifact[N + 1];

int main() {
  int n, m; cin >> n >> m >> mod;
  for (int i = 0, f = 1; i <= N; ++i) fact[i] = f, mul(f, i + 1);
  for (int i = N, f = fpow(fact[N], mod - 2); ~i; --i) ifact[i] = f, mul(f, i);
  dp[0][0] = 1;
  int ans = 0;
  for (int x = 1; x <= m; ++x) {
    for (int i = n; i--; )
    for (int j = 1; j <= n - i; ++j)
    for (int s = i; s <= min(i * x, n - x * j); ++s) addp(dp[i + j][s + x * j], dp[i][s], ifact[j]);
    if (auto c = m / x - m / (x + 1))
    for (int k = 1; k <= n; ++k)
    for (int i = 1; i <= min(k, n - k); ++i) {
      uint64_t cans = 0;
      for (int l = max(i, k - x - 1); l < k; ++l) cans += dp[i][l];
      add(ans, mul(cans % mod, ifact[k], ifact[n - i - k], c));
    }
    for (int k = 1; k <= n; ++k)
    for (int i = 1; i <= min(n - k, k - x - 2); ++i) add(ans, mul(+dp[i][k - x - 2], ifact[k], ifact[n - i - k], mod - m / (x + 1)));
  }
  mul(add(mul(ans, fact[n]), mul(+m, n)), 2);
  fill(dp[0] + 1, *end(dp), 0);
  for (int i = 0; i < n; ++i)
  for (int s = 0, t = 0; s <= min(i + 1, n / 2) * m; ++s) {
    dp[i + 1][s] = t;
    add(t, dp[i][s]);
    if (s >= m) add(t, mod - dp[i][s - m]);
  }
  for (int i = 0; i < n; ++i)
  for (int j = 0; j <= n - i; ++j) {
    uint64_t cans = 0, s = 0;
    for (s = 0; s <= min(i, j) * m; s += 18, cans %= mod)
    for (int d = 0; d < 18; ++d) cans += dp[i][s + d] * (uint64_t)dp[j][s + d];
    add(ans, mul(cans, ifact[i], ifact[j], ifact[n - i - j], fact[n]));
  }
  cout << add(mod - ans, fpow(2 * m + 1, n)) << '\n';
}