#include <bits/stdc++.h>

using namespace std;

using ull = unsigned long long;

struct FastMod {
  ull b, m;
  FastMod(ull b) : b(b), m(-1ULL / b) {}
  ull operator()(ull a) { ull r = a - (ull)((__uint128_t(m) * a) >> 64) * b; return r >= b ? r - b : r; }
} R(2);

int mod;
void add(int &x, int y) { if ((x += y - mod) < 0) x += mod; }
void sub(int &x, int y) { if ((x -= y) < 0) x += mod; }

const int N = 2e3;

int n, m;
int fac[N + 5], binom[N + 5][N + 5];
int f[N + 5][N + 5];
int ans;

int main() {
  scanf("%d%d%d", &n, &m, &mod), R = FastMod(mod);
  fac[0] = 1;
  for (int i = 1; i <= max(n, m); ++i) fac[i] = R((ull)fac[i - 1] * i);
  for (int i = 0; i <= max(n, m); ++i) {
    binom[i][0] = 1;
    for (int j = 1; j <= i; ++j) add(binom[i][j] = binom[i - 1][j], binom[i - 1][j - 1]);
  }
  f[0][0] = 1;
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) sub(f[i][j], f[i - 1][j - 1]);
    if (i == 1) continue;
    int coef = 2 * (i - 1) * (i - 2);
    for (int j = 0; j <= m; ++j) f[i][j] = R(f[i][j] + (ull)coef * f[i - 2][j]);
    for (int j = 2; j <= m; ++j) f[i][j] = R(f[i][j] + (ull)coef * f[i - 2][j - 2]);
    if (i == 2) continue;
    coef = (mod - (i - 1) * (i - 2));
    for (int j = 1; j <= m; ++j) f[i][j] = R(f[i][j] + (ull)coef * f[i - 3][j - 1]);
    for (int j = 3; j <= m; ++j) f[i][j] = R(f[i][j] + (ull)(mod - coef) * f[i - 3][j - 3]);
    if (i == 3) continue;
    coef = R((ull)(mod - (i - 1) * (i - 2)) * (i - 3) * (i - 4));
    for (int j = 0; j <= m; ++j) f[i][j] = R(f[i][j] + (ull)coef * f[i - 4][j]);
    for (int j = 2; j <= m; ++j) f[i][j] = R(f[i][j] + 2ull * (mod - coef) * f[i - 4][j - 2]);
    for (int j = 4; j <= m; ++j) f[i][j] = R(f[i][j] + (ull)coef * f[i - 4][j - 4]);
  }
  for (int i = 0, pw0 = 1; i <= n; ++i, pw0 = R((ull)pw0 * (n + m)))
    for (int j = 0, pw1 = pw0; j <= m; ++j, pw1 = R((ull)pw1 * n))
      ans = R(ans + R(R(R((ull)pw1 * binom[m][j]) * fac[m - j]) * binom[n][i]) * f[n - i][m - j]);
  printf("%d\n", ans);
}