#include <bits/stdc++.h>

#define FOR(i,a,b) for(ll i=(a);i<(b);i++)
#define REP(i,a) FOR(i,0,a)

using namespace std;

typedef long long ll;

const ll MAX_N=300,MAX_K=300;

ll N,K,M;

ll dp[MAX_N+1][MAX_K+1][MAX_N+1];

int main(){
	cin>>N>>K>>M;
	memset(dp,0,sizeof(dp));
	FOR(k,1,K+1){		
		FOR(n,1,N+1){
			for(ll m=n;m>0;m--){
				ll x;
				if (n==1){
					x=k%M;
				}else if (n==m){
					if (k==1){
						x=0;
					}else{
						x=(dp[n-1][k-1][1]*n+dp[n][k-1][1])%M;
					}
				}else{
					x=(dp[n-1][k][m]*m+dp[n][k][m+1])%M;
				}
				dp[n][k][m]=x;
			}
		}
	}
	cout<<dp[N][K][1]<<endl;
	return 0;
}