#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vl>;
using P=pair<ll,ll>;
using vp=vector<P>;
using vvp=vector<vp>;
const ll inf=LLONG_MAX/4;
#define rep2(i,j,k) for(ll i=ll(j);i<ll(k);i++)
#define rep(i,k) rep2(i,0,k)
#define rrep2(i,j,k) for(ll i=ll(j)-1;i>=ll(k);i--)
#define rrep(i,k) rrep2(i,k,0)
#define eb emplace_back
#define SZ(a) ll(a.size())
#define all(a) a.begin(),a.end()
template<class T>
bool chmin(T& a, T b){return a>b?a=b,1:0;}
template<class T>
bool chmax(T& a, T b){return a<b?a=b,1:0;}

int mod = 1;

struct mint {
	int x;
	mint(ll x = 0) : x((x%mod+mod)%mod) {}

	mint &operator+=(const mint &a) { if((x += a.x) >= mod) x -= mod; return *this; }
	mint &operator-=(const mint &a) { if((x += mod-a.x) >= mod) x -= mod; return *this; }
	mint &operator*=(const mint &a) { x = (ll) x * a.x % mod; return *this; }

	mint operator+(const mint &a) { return mint(*this) += a; }
	mint operator-(const mint &a) { return mint(*this) -= a; }
	mint operator*(const mint &a) { return mint(*this) *= a; }

	mint pow(ll t) {
		mint res(1), a(*this);
		while(t) {
			if(t&1) res *= a;
			a *= a;
			t >>= 1;
		}
		return res;
	}
};

mint dp[101][101][10001];

mint sub[101][20001];

const int C = 100000;
mint fac[C+1], ifac[C+1];
mint binom(int n, int k) {
	assert(n >= 0);
	if(k < 0 or k > n) return 0;
	return fac[n] * ifac[k] * ifac[n-k];
}

mint A[110][10010];
mint B[110][10010];

int main(){
	cin.tie(0)->sync_with_stdio(0);
	int n, m;
	cin >> n >> m >> mod;
	fac[0] = 1;
	rep(i, C) fac[i+1] = fac[i] * (i+1);
	ifac[C] = fac[C].pow(mod-2);
	rrep(i, C) ifac[i] = ifac[i+1] * (i+1);
	dp[0][0][0] = 1;
	rep(i, n) {
		rep(j, m+1) rep(k, (i+1)*j+1) A[j][k] = B[j][k] = 0;
		rep(j, m+1) rep(k, i*j+1) {
			A[j][k+1] += dp[i][j][k];
			A[j][k+j+1] -= dp[i][j][k];
			B[j+1][k+j+1] += dp[i][j][k];
		//	rep2(l, 1, m+1) dp[i+1][max(j,l)][k+l] += dp[i][j][k];
		}
		rep(j, m+1) rep(k, (i+1)*j+1) {
			A[j][k+1] += A[j][k];
			B[j+1][k+1] += B[j][k];
			dp[i+1][j][k] += A[j][k];
			dp[i+1][j][k] += B[j][k];
		}
	}
//	rep2(i, 1, n+1) rep(k, i*m+1) {
//		mint pre;
//		rep2(j, 1, m+1) {
//			mint now;
//			if(i*j < k) continue;
//			rep(l, i+1) {
//				if(l*(j+1) > k) continue;
//				mint tmp = binom(i, l) * binom(k-l*(j+1)+i-1, i-1);
//				if(l&1) now -= tmp;
//				else now += tmp;
//			}
//			assert((now-pre).x == dp[i][j][k].x);
//			pre = now;
//		}
//	}
	sub[0][0] = 1;
	rep(i, n) rep(j, 2*m*i+1) rep(k, 2*m+1) if(k != m) sub[i+1][j+k] += sub[i][j];
	mint ans;
	rep(i, n+1) rep(j, m+1) rrep(k, n*m) dp[i][j][k] += dp[i][j][k+1];
	rep2(i, 2, n+1) {
		mint now;
		rep2(a, 1, m+1) rep2(j, 1, i+1) rep(k, m/a+1) {
			mint tmp;
			int lb = max(0LL, j-k-1);
			int ub = j;
			assert(lb <= ub);
			tmp += dp[i-j][k][lb];
			tmp -= dp[i-j][k][ub];
			//rep2(l, lb, ub) {
			//	tmp += dp[i-j][k][l];
			//}
			now += tmp * binom(i, j);
		}
		now *= 2;
		now += sub[i][i*m];
		mint cur = 1;
		rep(_, i) cur *= 2*m;
		cur -= now;
		cur *= binom(n, i);
		ans += cur;
	}
	cout << ans.x << endl;
}