#include<iostream>
#include<cstdio>
#include<set>
#define N 4000
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int n,m,mod,a[N+1],dp[N+1],dp2[N+1],DP[N+1][N+1],F[N+1];
int MD(int x)
{
	return x>=mod?x-mod:x;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
struct reads
{
	int d[N+1];
	bool operator < (const reads &t)const
	{
		for (int i=1;i<=n;++i)
			if (d[i]!=t.d[i])
				return d[i]<t.d[i];
		return 0;
	}
};
reads sx;
set<reads>s;
void dfs(int x)
{
	if (x==n+1)
	{
		for (int i=1;i<=n;++i) dp[i]=max(dp[i-1],dp[max(i-2,0)]+a[i]);
		for (int i=n;i>=1;--i) dp2[i]=max(dp2[i+1],dp2[i+2]+a[i]);
		for (int i=1;i<=n;++i) sx.d[i]=dp[i-1]+dp2[i+1];
		s.insert(sx);
		return;
	}
	for (int i=0;i<=m;++i) a[x]=i,dfs(x+1);
	return;
}
int main()
{
	n=read(),m=read(),mod=read();
	if (n<=5&&m<=5) dfs(1),printf("%d\n",s.size());
	else
	{
		for (int i=5;i<=n+3;++i) F[i]=(i-3)>>1;
		DP[0][0]=1;
		for (int i=1;i<=n+3;++i)
			for (int j=2;j<=i;++j)
			{
				Adder(DP[i][0],DP[i-j][0]);
				Adder(DP[i][1],DP[i-j][1]);
				Adder(DP[i][1],1ll*DP[i-j][0]*F[j]%mod);
			}
		printf("%d\n",MD(DP[n+3][0]+DP[n+3][1]));
	}
	return 0;
}