#include <bits/stdc++.h>

using namespace std;

using ll = long long;

int mod;

int mpow(int a, int b) {
  int ret = 1;
  for (; b; b >>= 1) {
    if (b & 1) ret = (ll)ret * a % mod;
    a = (ll)a * a % mod;
  }
  return ret;
}

const int table[10][10] = {
  {},
  {1},
  {1, 4, 9, 16, 25},
  {1, 6, 17, 36, 65, 106},
  {1, 12, 47, 120, 245, 436, 707},
  {1, 19, 94, 281, 649, 1281, 2274, 3739},
  {1, 35, 227, 803, 2089, 4511, 8595, 14967, 24353},
  {1, 58, 477, 1960, 5705, 13506, 27853, 52032, 90225}
};

const int N = 3e3;

int n, m;
int f[N + 5];

int main() {
  scanf("%d%d%d", &n, &m, &mod);
  for (int i = 2; i <= 7; ++i) {
    for (int j = 0; j <= i; ++j) {
      int u = table[i][j] % mod, v = 1;
      for (int k = 0; k <= i; ++k)
        if (j != k) u = (ll)u * (m - k + mod) % mod, v = (ll)v * (j - k + mod) % mod;
      f[i] = (f[i] + (ll)u * mpow(v, mod - 2)) % mod;
    }
  }
  for (int i = 8; i <= n; ++i)
    f[i] = (f[i - 1] * 2 + 2ll * m * f[i - 2] + (ll)(mod - m * 2 - 2) * f[i - 3]) % mod,
    f[i] = (f[i] + ((ll)(m + 2) * (mod - m) + 1) % mod * f[i - 4] + 2ll * m * f[i - 5]) % mod,
    f[i] = (f[i] + (ll)m * m * f[i - 6]) % mod;
  printf("%d\n", f[n]);
}