#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ri register
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
const int inf=0x3f3f3f3f;
inline int rd(){
	int x=0,y=1;char c=getchar();
	for(;c<'0'||c>'9';c=getchar())if(c=='-')y=-1;
	for(;c>='0'&&c<='9';c=getchar())x=(x<<1)+(x<<3)+(c^48);
	return x*y;
}
const int N=150+5;
int n,m,mod,c[N][N],fac[N],f[N][N][N];
void add(int &x,int y){
    x+=y;if(x>=mod)x-=mod;
}
signed main(){
	n=rd();m=rd();mod=rd();
    if(m>=n)return puts("0"),0;
    fac[0]=c[0][0]=f[0][1][0]=1;
    for(int i=1;i<=n;i++){
        fac[i]=1ll*fac[i-1]*i%mod;
        c[i][0]=1;
        for(int j=1;j<=i;j++)
            c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod;
    }
    for(int i=1;i<=m;i++)
        for(int j=1;j<=n;j++)
            for(int k=0;k<=j;k++){
                for(int l=0;l<k;l++)add(f[i][j][l],1ll*f[i-1][j][k]*c[k][l]%mod);
                for(int l=1;l<=n-j;l++)add(f[i][j+l][k+l-1],1ll*f[i-1][j][k]*j%mod);
            }
    cout<<f[m][n][0]*fac[n]%mod<<'\n';
	return 0;
}