#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
int mod;
inline int fp(int x,int p=mod-2,int res=1){
	for(;p;p>>=1){if(p&1)res=1ll*res*x%mod;x=1ll*x*x%mod;}
	return res;
}
inline void Ad(int &x,int y){x=x+y>=mod?x+y-mod:x+y;}
inline void Mi(int &x,int y){x=x-y<0?x-y+mod:x-y;}
const int N=402;
int n,K,f[N][N],C[N][N],g[N],c[N];
int main() {
	cin>>n>>K>>mod;
	rep(i,0,n){
		C[i][0]=1;
		rep(j,1,i)Ad(C[i][j]=C[i-1][j],C[i-1][j-1]);
	}
	rep(j,1,n){
		f[j][1]=j;
		rep(i,2,n)f[j][i]=1ll*f[j][i-1]*j%mod;
		per(k,j,1){
			int a[2];
			rep(d,0,1)a[d]=0;
			rep(i,1,n){
				Ad(f[j][i],a[1]),Mi(f[j][i],a[0]);
				rep(d,0,1)a[d]=1ll*(k-d)*(1ll*a[d]+f[j-k+1][i]-f[j-k][i]+mod)%mod;
			}
		}
	}
	rep(j,1,n){
		g[j]=f[j][n];
		rep(i,1,j-1)Mi(g[j],1ll*C[j][i]*g[i]%mod);
	}
	c[0]=1;
	rep(i,1,n)c[i]=1ll*c[i-1]*fp(i)%mod*(K-i+1)%mod;
	int ans=0;
	rep(i,1,n)Ad(ans,1ll*c[i]*g[i]%mod);
	cout<<ans;
    return 0;
}