#include <bits/stdc++.h>
#define X first
#define Y second
#define PB push_back
#define x first
#define y second
#define pb push_back
using namespace std;
using ll=long long;
using vi=vector<int>;
using vl=vector<ll>;
using pii=pair<int,int>;
#define all(a) begin(a),end(a)

const int N=110;
const char en='\n';
const ll LLINF=1ll<<60;

int p;

int add(int a,int b)
{
	if (a+b>=p) return a+b-p;
	return a+b;
}

void ad(int&a,int b)
{
	a+=b;
	if (a>=p) a-=p;
}

int sub(int a,int b)
{
	if (a<b) return a-b+p;
	return a-b;
}

int mul(int a,int b)
{
	return a*1ll*b%p;
}

int n,m,dp1[N][2*N*N],dp2[N][N][N],cho[N][N],psc[N][N];

int solve()
{
	for (int i=0;i<=n;++i) for (int j=0;j<=n;++j) for (int k=0;k<=m;++k) dp2[i][j][k]=0;
	dp2[0][0][0]=1;
	int c=0;
	for (int i=0;i<n;++i) for (int j=0;j<n-i;++j) for (int k=0;k<=m;++k) if (dp2[i][j][k])
	{
		if (i)
		{
			int st=mul(cho[n][i],sub(psc[n-i][min(j+k+1,n-i)],psc[n-i][j]));
			ad(c,mul(dp2[i][j][k],st));
		}
		for (int ne=1;ne<=m && j+ne<n-(i+1);++ne)
		{
			ad(dp2[i+1][j+ne][max(k,ne)],dp2[i][j][k]);
		}
	}
	return c;
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin>>n>>m>>p;
	for (int i=0;i<=n;++i)
	{
		cho[i][0]=1;
		psc[i][0]=1;
		for (int j=1;j<=i;++j)
		{
			cho[i][j]=add(cho[i-1][j],cho[i-1][j-1]);
			psc[i][j]=add(psc[i][j-1],cho[i][j]);
		}
	}
	int an=2*n*m;
	dp1[0][N*N]=1;
	for (int i=0;i<n;++i) for (int j=N*N-m*i;j<=N*N+m*i;++j) for (int k=-m;k<=m;++k) ad(dp1[i+1][j+k],dp1[i][j]);
	ad(an,dp1[n][N*N]);
	//cout<<an<<en;
	for (int x=1;x<=m;++x)
	{
		int m1=m;
		m/=x;
		int cs=solve();
		ad(an,mul(cs,2));
		m=m1;
	}
	int sv=1;
	for (int i=0;i<n;++i) sv=mul(sv,2*m+1);
	cout<<sub(sv,an)<<en;
}