/*
I know this sky loves you
いずれ全て
変わってしまったって
空は青いだろうよ
*/

# include <bits/stdc++.h>
# define int long long

const int N=105,INF=0x3f3f3f3f,V=100;
int mod;

inline int read(void){
	int res,f=1;
	char c;
	while((c=getchar())<'0'||c>'9')
		if(c=='-') f=-1;
	res=c-48;
	while((c=getchar())>='0'&&c<='9')
		res=res*10+c-48;
	return res*f;
}

inline int adc(int a,int b){return (a+b>=mod)?(a+b-mod):(a+b);}
inline int dec(int a,int b){return (a<b)?(a-b+mod):(a-b);}
inline int mul(int a,int b){return 1ll*a*b%mod;}
inline void add(int &a,int b){a=adc(a,b);}
inline void del(int &a,int b){a=dec(a,b);}

inline int qpow(int d,int p){
//	printf("d = %d p = %d\n",d,p);	
	int ans=1;
	while(p){
		if(p&1) ans=1ll*ans*d%mod;
		d=1ll*d*d%mod,p>>=1;
	}
	return ans;
}

int dp[N][N][N];
int n,m;
int fac[N],finv[N];

int g[N][N];

inline void init(void){
	fac[0]=finv[0]=1;
	for(int i=1;i<=V;++i) fac[i]=mul(i,fac[i-1]),finv[i]=qpow(fac[i],mod-2);
	return;
}
inline int bi(int n,int m){
	if(n<m||n<0||m<0) return 0;
	return mul(mul(fac[n],finv[m]),finv[n-m]);
}

int pw_m[N];

// int arr[N][N][N]; // choosing i 

int suming[N][N*N*2];

const int Z=10005;

int h[N][N][N];

signed main(void){
//	freopen("in.txt","r",stdin);
	
	n=read(),m=read(),mod=read();
	
	pw_m[0]=1;
	for(int i=1;i<=n;++i) pw_m[i]=mul(pw_m[i-1],m);
	
	suming[0][Z]=1;
	for(int i=1;i<=n;++i){
		for(int s=-(i-1)*m;s<=(i-1)*m;++s){
			for(int d=-m;d<=m;++d) add(suming[i][s+d+Z],suming[i-1][s+Z]);
		}
	}
	
//	arr[0][0][0]=1;
	
	init();
	
	dp[0][0][0]=1;
	
//	std::cout<<finv[1]<<"A"<<std::endl;
	
	for(int v=1;v<=m;++v){
		memcpy(dp[v],dp[v-1],sizeof(dp[v]));
		for(int l=0;l<=n;++l){
			for(int sum=0;sum<=n;++sum){
				if(!dp[v-1][l][sum]) continue;
				for(int k=1;l+k<=n&&sum+k*v<=n;++k){
					add(dp[v][l+k][sum+k*v],mul(dp[v-1][l][sum],finv[k]));
					add(h[v][l+k][sum+k*v],mul(dp[v-1][l][sum],finv[k]));
				}
			}
		}
	}
	
//	printf("DEBUG = %d\n",dp[1][1][1]);
	
	for(int v=0;v<=m;++v){
		for(int l=0;l<=n;++l){
			for(int sum=1;sum<=n;++sum) add(h[v][l][sum],h[v][l][sum-1]);
		}
	}
	
//	printf("DEBUG = %d\n",dp[1][1][1]);
	
	int ans=qpow(2*m+1,n);
	
//	printf("ans = %d\n",ans);
	
	del(ans,mul(n,2*m)); // from 1 positive (negative)
	
//	printf("ans = %d\n",ans);
	
	del(ans,suming[n][Z]); // from sum = 0
	
//	printf("A = %d B = %d\n",mul(n,2*m),suming[n][Z]);
	
//	printf("ans = %d\n",ans);
	
	for(int zc=0;zc<=n;++zc){ // zero_counting
		for(int v=1;v<=m;++v){
			for(int po=1;po+zc<=n;++po){ // positive vs
				for(int ne=n-po-zc;ne==n-po-zc;++ne){
				for(int mx_ne=0;mx_ne<=m/v;++mx_ne){
					if(ne==0) continue;
					
					// IT IS VALID IFF: po >= mx_ne + sum + 2
					// sum <= po - mx_ne - 2
					
					// INVALID IFF: sum > po - mx_ne - 2
					
//					printf("v = %d zc = %d po = %d ne = %d\n",v,zc,po,ne);
					
					int ways=h[mx_ne][ne][po-1];
					if(po-mx_ne-2>=0) del(ways,h[mx_ne][ne][po-mx_ne-2]);
					
//					printf("lim = %d [%d,%d]\n",lim,slim+1,po-1);
					
					ways=mul(ways,fac[ne]);
					
//					ways=dec(pw_m[ne],ways);
//					printf("ways = %d\n",ways);
					
					int op=mul(mul(fac[n],finv[zc]),mul(finv[po],finv[ne]));
					del(ans,mul(mul(2,op),ways)); // positive & negative
					// calculating len = ne 
				}
				}
			}
		}
	}
	
	printf("%lld",ans);

	return 0;
}