#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse4")
using namespace std;
long long mod = 1000000009;
const long long INF = mod * mod;
const double eps = 1e-12;
const double pi = acosl(-1.0);
long long mod_pow(long long x, long long n, long long m = mod) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % m;
    x = x * x % m;
    n >>= 1;
  }
  return res;
}
struct modint {
  long long n;
  modint() : n(0) { ; }
  modint(long long m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) {
  a.n += b.n;
  if (a.n >= mod) a.n -= mod;
  return a;
}
modint operator-=(modint& a, modint b) {
  a.n -= b.n;
  if (a.n < 0) a.n += mod;
  return a;
}
modint operator*=(modint& a, modint b) {
  a.n = ((long long)a.n * b.n) % mod;
  return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, long long n) {
  if (n == 0) return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2) res = res * a;
  return res;
}
long long inv(long long a, long long p) {
  return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;
mP mul(mP a, mP b) {
  return {a.first * b.first, a.second * b.first + a.first * b.second};
}
mP plu(mP a, mP b) { return {a.first + b.first, a.second + b.second}; }
mP dp[501];
bool used[501];
void init() {
  init_f();
  dp[0] = {1, 0};
  dp[1] = {2, 0};
  for (int n = 2; n <= 500; n++) {
    for (int j = 0; j < n; j++) {
      modint cnt = n + 1;
      modint sum = 0;
      for (int k = 0; k < n; k++) sum += abs(j - k);
      mP cl = dp[j];
      mP cr = dp[n - 1 - j];
      mP x = mul(cl, cr);
      x.first *= comb(n - 1, j);
      x.second *= comb(n - 1, j);
      x = mul(x, {cnt, sum});
      dp[n] = plu(dp[n], x);
    }
  }
}
mP dp2[502][501];
void solve() {
  int n, m;
  cin >> n >> m >> mod;
  init();
  dp2[0][0] = {1, 0};
  for (int i = 0; i < n; i++) {
    for (int k = 0; k < i + 1; k++) {
      for (int j = i; j < n; j++) {
        int ni = j + 2;
        ni = min(ni, n);
        int nk = k + j - i + 1;
        if (nk <= m) {
          mP x = mul(dp2[i][k], dp[j - i + 1]);
          x.first *= comb(nk, k);
          x.second *= comb(nk, k);
          dp2[ni][nk] = plu(dp2[ni][nk], x);
        }
      }
      dp2[i + 1][k] = plu(dp2[i + 1][k], dp2[i][k]);
    }
  }
  modint ans = dp2[n][m].second;
  cout << ans << "\n";
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
