#include <bits/stdc++.h>

using i64 = long long;

template<class T>
T qmi(T a, i64 b) {
  T res = 1;
  for (; b; b /= 2, a *= a) {
    if (b % 2) {
      res *= a;
    }
  }
  return res;
}

i64 mul(i64 a, i64 b, i64 p) {
  i64 res = a * b - i64(1.L * a * b / p) * p;
  res %= p;
  if (res < 0) {
    res += p;
  }
  return res;
}

template<int P>
struct modint {
  int x;
  constexpr modint() : x{} {}
  constexpr modint(i64 x) : x{norm(x % getmod())} {}

  static int mod;
  constexpr static int getmod() {
    if (P > 0) {
      return P;
    } else {
      return mod;
    }
  }
  constexpr static void setmod(int m) {
    mod = m;
  }
  constexpr int norm(int x) const {
    if (x < 0) {
      x += getmod();
    }
    if (x >= getmod()) {
      x -= getmod();
    }
    return x;
  }
  constexpr int val() const {
    return x;
  }
  explicit constexpr operator int() const {
    return x;
  }
  constexpr modint operator-() const {
    modint res;
    res.x = norm(getmod() - x);
    return res;
  }
  constexpr modint inv() const {
    assert(x != 0);
    return qmi(*this, getmod() - 2);
  }
  constexpr modint &operator*= (modint v) & {
    x = 1LL * x * v.x % getmod();
    return *this;
  }
  constexpr modint &operator+= (modint v) & {
    x = norm(x + v.x);
    return *this;
  }
  constexpr modint &operator-= (modint v) & {
    x = norm(x - v.x);
    return *this;
  }
  constexpr modint &operator/= (modint v) & {
    return *this *= v.inv();
  }
  friend constexpr modint operator- (modint a, modint b) {
    modint res = a;
    res -= b;
    return res;
  }
  friend constexpr modint operator+ (modint a, modint b) {
    modint res = a;
    res += b;
    return res;
  }
  friend constexpr modint operator* (modint a, modint b) {
    modint res = a;
    res *= b;
    return res;
  }
  friend constexpr modint operator/ (modint a, modint b) {
    modint res = a;
    res /= b;
    return res;
  }
  friend constexpr std::istream &operator>> (std::istream& is, modint& a) {
    i64 v;
    is >> v;
    a = modint(v);
    return is;
  }
  friend constexpr std::ostream &operator<< (std::ostream& os, const modint& a) {
    return os << a.val();
  }
  friend constexpr bool operator== (modint a, modint b) {
    return a.val() == b.val();
  }
  friend constexpr bool operator!= (modint a, modint b) {
    return a.val() != b.val();
  }
};

template<>
int modint<0>::mod = 998244353;
using mint = modint<0>;

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int n, m, p;
  std::cin >> n >> m >> p;

  mint::mod = p;

  mint ans = qmi(mint(m * 2 + 1), n);
  {
    std::vector<mint> dp(n * m + 1);
    dp[0] = 1;
    for (int i = 0; i < n; i++) {
      for (int j = 1; j <= n * m; j++) {
        dp[j] += dp[j - 1];
      }
      for (int j = n * m; j >= m * 2 + 1; j--) {
        dp[j] -= dp[j - m * 2 - 1];
      }
    }
    ans -= dp[n * m];
  }

  auto get = [&](int m) {
    mint ans = 0;
    for (int s = 1; s <= n; s++) {
      std::vector<std::array<mint, 2>> dp(n * 2 + 1);
      dp[n][0] = 1;
      for (int i = 0; i < n; i++) {
        std::vector<std::array<mint, 2>> ndp(n * 2 + 1);
        for (int j = 0; j <= n * 2; j++) {
          for (int t = 0; t < 2; t++) {
            int l = std::max(-j, -m);
            int r = std::min(n * 2 - j + 1, 2 - s);
            if (l < r) {
              ndp[j + l][1] += dp[j][t];
              if (j + r <= n * 2) {
                ndp[j + r][1] -= dp[j][t];
              }
            }
            l = std::max({-j, -m, 2 - s});
            r = std::min(n * 2 - j + 1, 2);
            if (l < r) {
              ndp[j + l][t] += dp[j][t];
              if (j + r <= n * 2) {
                ndp[j + r][t] -= dp[j][t];
              }
            }
          }
        }
        for (int j = 1; j <= n * 2; j++) {
          for (int t = 0; t < 2; t++) {
            ndp[j][t] += ndp[j - 1][t];
          }
        }
        dp = std::move(ndp);
      }
      ans += dp[n + s][1];
    }
    return ans;
  };

  for (int l = 1, r; l <= m; l = r + 1) {
    r = m / (m / l);
    ans -= (r - l + 1) * get(m / l) * 2;
  }
  std::cout << ans << "\n";

  return 0;
}