#include <bits/stdc++.h>
#define REP(i, l, r) for (int i = (l); i <= (r); ++ i)
#define DEP(i, r, l) for (int i = (r); i >= (l); -- i)
#define fi first
#define se second
#define pb emplace_back
#define mems(x, v) memset((x), (v), sizeof(x))
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(), (x).end()
using namespace std;
namespace math {
	typedef long long LL;
	template <class T> T qpow(T a, LL b) { if (!b) return {1}; T rs = a; b --; for (; b; b >>= 1, a = a * a) if (b & 1) rs = rs * a; return rs; }
	LL mul(LL a, LL b, LL p) { LL rs = a * b - LL(1.L * a * b / p) * p; rs %= p; if (rs < 0) rs += p; return rs; }
	template <unsigned P = 0> struct mint {
		unsigned v; static unsigned mod; mint() = default;
		template <class T> mint(T x) { x %= getmod(), v = x < 0 ? x + getmod() : x; }
		static int getmod() { if (P > 0) return P; else return mod; }
		static void setmod(unsigned m) { mod = m; }
		mint operator + () const { return *this; }
		mint operator - () const { return mint(0) - *this; }
		mint inv() const { return assert(v), qpow(*this, getmod() - 2); }
		int val() const { return v; }
		mint &operator += (const mint &q) { if (v += q.v, v >= getmod()) v -= getmod(); return *this; }
		mint &operator -= (const mint &q) { if (v -= q.v, v >= getmod()) v += getmod(); return *this; }
		mint &operator *= (const mint &q) { v = 1ull * v * q.v % getmod(); return *this; }
		mint &operator /= (const mint &q) { return *this *= q.inv(); }
		friend mint operator + (mint p, const mint &q) { return p += q; }
		friend mint operator - (mint p, const mint &q) { return p -= q; }
		friend mint operator * (mint p, const mint &q) { return p *= q; }
		friend mint operator / (mint p, const mint &q) { return p /= q; }
		friend bool operator == (const mint &p, const mint &q) { return p.v == q.v; }
		friend bool operator != (const mint &p, const mint &q) { return p.v != q.v; }
		friend bool operator < (const mint &p, const mint &q) { return p.v < q.v; }
		friend bool operator > (const mint &p, const mint &q) { return p.v > q.v; }
		friend bool operator <= (const mint &p, const mint &q) { return p.v <= q.v; }
		friend bool operator >= (const mint &p, const mint &q) { return p.v >= q.v; }
		friend istream &operator >> (istream &is, mint &a) { is >> a.v; return is; }
		friend ostream &operator << (ostream &os, const mint &a) { os << a.v; return os; }
	};
	template <> unsigned mint<0>::mod = 998244353;
}
namespace Milkcat {
	using namespace math;
	typedef long long LL;
	typedef pair<LL, LL> pii;
	const int N = 105;
	typedef mint<0> MI;
	int n, m, mod; MI C[N][N], f[N][N][N], g[N][N * N * 2];
	int main() {
		cin >> n >> m >> mod, MI::setmod(mod);
		int t = n * m; g[0][t] = 1, g[0][t + 1] = -1;
		REP(i, 0, n) REP(j, 0, t * 2) {
			if (j > 0) g[i][j] += g[i][j - 1];
			g[i + 1][max(j - m, 0)] += g[i][j];
			g[i + 1][min(j + m, t * 2) + 1] -= g[i][j];
		}
		MI rs = g[n][t]; C[0][0] = 1;
		REP(x, 0, m) {
			f[x][0][0] = 1, f[x][0][1] = -1;
			REP(i, 0, n) REP(j, 0, n) {
				if (j > 0) f[x][i][j] += f[x][i][j - 1];
				f[x][i + 1][j] += f[x][i][j];
				f[x][i + 1][min(j + x, n) + 1] -= f[x][i][j];
			}
		}
		REP(i, 1, n) REP(j, 0, i) {
			C[i][j] = C[i - 1][j];
			if (j > 0) C[i][j] += C[i - 1][j - 1];
		}
		REP(x, 1, m) REP(S, 1, min(n, m / x + 1)) REP(i, S, n - 1) {
			int v = i - S;
			rs += (f[m / x][n - i][v] - (S > 1 ? f[S - 2][n - i][v] : 0)) * C[n][i] * 2;
		}
		cout << qpow((MI)m * 2 + 1, n) - rs << '\n';
		return 0;
	}
}
int main() {
	cin.tie(0)->sync_with_stdio(0);
	int T = 1;
	while (T --) Milkcat::main();
	return 0;
}