#include <bits/stdc++.h>
clock_t __t = clock();
namespace my_std {
using namespace std;
long long mod;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
inline T rnd(T l, T r) {
  return uniform_int_distribution<T>(l, r)(rng);
}
template <typename T>
inline bool chkmax(T& x, T y) {
  return x < y ? x = y, 1 : 0;
}
template <typename T>
inline bool chkmin(T& x, T y) {
  return x > y ? x = y, 1 : 0;
}
template <typename T>
inline void read(T& t) {
  t = 0;
  char f = 0, ch = getchar();
  double d = 0.1;
  while (ch > '9' || ch < '0') f |= (ch == '-'), ch = getchar();
  while (ch <= '9' && ch >= '0') t = t * 10 + ch - 48, ch = getchar();
  if (ch == '.') {
    ch = getchar();
    while (ch <= '9' && ch >= '0') t += d * (ch ^ 48), d *= 0.1, ch = getchar();
  }
  t = (f ? -t : t);
}
template <typename T, typename... Args>
inline void read(T& t, Args&... args) {
  read(t);
  read(args...);
}
char __sr[1 << 21], __z[20];
int __C = -1, __zz = 0;
inline void Ot() { fwrite(__sr, 1, __C + 1, stdout), __C = -1; }
inline void print(int x) {
  if (__C > 1 << 20) Ot();
  if (x < 0) __sr[++__C] = '-', x = -x;
  while (__z[++__zz] = x % 10 + 48, x /= 10)
    ;
  while (__sr[++__C] = __z[__zz], --__zz)
    ;
  __sr[++__C] = '\n';
}
void file() {}
inline void chktime() {}
long long ksm(long long x, int y) {
  long long ret = 1;
  for (; y; y >>= 1, x = x * x % mod)
    if (y & 1) ret = ret * x % mod;
  return ret;
}
long long inv(long long x) { return ksm(x, mod - 2); }
}  // namespace my_std
using namespace my_std;
long long fac[1055], _fac[1055];
void init() {
  _fac[0] = fac[0] = 1;
  for (int i = (1); i <= (1055 - 1); i++)
    _fac[i] = inv(fac[i] = fac[i - 1] * i % mod);
}
long long C(int n, int m) {
  return n >= m && m >= 0 ? fac[n] * _fac[m] % mod * _fac[n - m] % mod : 0;
}
int n, m;
long long f(int n, int m) {
  return ksm(2 * (n + 1), m) * inv(n + 1) % mod * (n + 1 - m) % mod;
}
int main() {
  file();
  read(n, m, mod);
  ++n;
  init();
  long long ans = 0;
  for (int i = (1); i <= (m); i++)
    for (int j = (1); j <= (i - 1); j++)
      (ans += C(i - 1, j) * f(j, j) % mod * f(max(0, n - 2 - j), i - j - 1) %
              mod * ksm(2 * n, m - i) % mod * C(j + 1, 2) % mod * 2 % mod * n %
              mod) %= mod;
  ans = ans * inv(n) % mod * (n - m) % mod;
  cout << ans;
  return 0;
}
