//start of jonathanirvings' template v3.0.3 (BETA)

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<LL> vl;
typedef vector<vl> vvl;

double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
double PI = acos(-1);
int dirx[8] = {-1,0,0,1,-1,-1,1,1};
int diry[8] = {0,1,-1,0,-1,1,-1,1};

#ifdef TESTING
  #define DEBUG fprintf(stderr,"====TESTING====\n")
  #define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
  #define debug(...) fprintf(stderr, __VA_ARGS__)
#else
  #define DEBUG 
  #define VALUE(x)
  #define debug(...)
#endif

#define FOR(a,b,c) for (int (a)=(b);(a)<(c);++(a))
#define FORN(a,b,c) for (int (a)=(b);(a)<=(c);++(a))
#define FORD(a,b,c) for (int (a)=(b);(a)>=(c);--(a))
#define FORSQ(a,b,c) for (int (a)=(b);(a)*(a)<=(c);++(a))
#define FORC(a,b,c) for (char (a)=(b);(a)<=(c);++(a))
#define FOREACH(a,b) for (auto &(a) : (b))
#define REP(i,n) FOR(i,0,n)
#define REPN(i,n) FORN(i,1,n)
#define MAX(a,b) a = max(a,b)
#define MIN(a,b) a = min(a,b)
#define SQR(x) ((LL)(x) * (x))
#define RESET(a,b) memset(a,b,sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(),v.end()
#define ALLA(arr,sz) arr,arr+sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr,sz) sort(ALLA(arr,sz))
#define REVERSEA(arr,sz) reverse(ALLA(arr,sz))
#define PERMUTE next_permutation
#define TC(t) while(t--)

inline string IntToString(LL a){
  char x[100];
  sprintf(x,"%lld",a); string s = x;
  return s;
}

inline LL StringToInt(string a){
  char x[100]; LL res;
  strcpy(x,a.c_str()); sscanf(x,"%lld",&res);
  return res;
}

inline string GetString(void){
  char x[1000005];
  scanf("%s",x); string s = x;
  return s;
}

inline string uppercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'a' && s[i] <= 'z') s[i] = s[i] - 'a' + 'A';
  return s;
}

inline string lowercase(string s){
  int n = SIZE(s); 
  REP(i,n) if (s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
  return s;
}

inline void OPEN (string s) {
  #ifndef TESTING
  freopen ((s + ".in").c_str (), "r", stdin);
  freopen ((s + ".out").c_str (), "w", stdout);
  #endif
}

//end of jonathanirvings' template v3.0.3 (BETA)

namespace bf
{
  bool subset(vector<int> a,vector<int> b)
  {
    REP(i,SIZE(b))
    {
      vi c = b;
      c.erase(c.begin() + i);
      if (c == a) return true;
    }
    return false;
  }

  vector<vector<int>> ada[300];
  int n,k;
  int res;

  void dfs(vector<int> v)
  {
    ada[SIZE(v)].pb(v);
    if (SIZE(v) == n) return;
    REP(i,k)
    {
      v.pb(i);
      dfs(v);
      v.pop_back();
    }
  }

  void dfs2(vector<vector<int>> vv)
  {
    if (SIZE(vv) == n + 1)
    {
      REP(i,n) if(vv[i] > vv[i+1]) return;
      REP(i,n) if(!subset(vv[i],vv[i+1])) return;
      ++res;
      return;
    }
    for (vector<int> v : ada[SIZE(vv)])
    {
      vv.pb(v);
      dfs2(vv);
      vv.pop_back();
    }
  }

  int count(int _n, int _k)
  {
    n = _n; k = _k;
    FORN(i,0,n) ada[i].clear();
    dfs({});
    res = 0;
    dfs2({});
    return res;
  }
}

int n,k;
LL m;
LL C[305][305];
LL dp[305][305];

void BF()
{
  printf("%d\n",bf::count(n,k));
  FORN(i,1,6)
  {
    FORN(j,1,6)
    {
      printf("%10d",bf::count(i,j));
    }
    puts("");
  }
}

LL A(int n,int k)
{
  if (n == 0 || k == 0) return 1;
  LL &ret = dp[n][k];
  if (ret >= 0) return ret;
  ret = 0;
  FORN(j,1,n)
  {
    LL tmp = C[n-1][j-1] * A(j,k-1) % m;
    tmp = tmp * A(n-j,k) % m;
    ret = (ret + tmp) % m;
  }
  return ret;
}

int main()
{
  scanf("%d %d %lld",&n,&k,&m);
  // BF();
  FORN(i,0,n)
  {
    C[i][0] = C[i][i] = 1;
    FOR(j,1,n)
    {
      C[i][j] = (C[i-1][j-1] + C[i-1][j]) % m;
    }
  }
  RESET(dp,-1);
  // FORN(i,0,6)
  // {
  //   FORN(j,0,6)
  //   {
  //     printf("%5lld",A(i,j));
  //   }
  //   puts("");
  // }
  LL risan = A(n+1,k-1);
  printf("%lld\n",risan);
  return 0;
}











Measured memory_bytes: 1792