#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#ifdef WAIMAI
#define debug(HEHE...) cout<<"["<<#HEHE<<"] : ",dout(HEHE)
void dout(){cout<<'\n';}
template<typename T,typename...U>
void dout(T t,U...u){cout<<t<<(sizeof...(u)?", ":""),dout(u...);}
#else
#define debug(...) 7122
#endif

#define int long long
#define ll long long
#define Waimai ios::sync_with_stdio(false),cin.tie(0)
#define FOR(x,a,b) for(int x=a,I=b;x<=I;x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 2100;

int n, r, mod;
int dp[SIZE][SIZE];

void solve() {
    cin >> r >> n >> mod;
    dp[1][1] = 1;
    FOR (i, 2, n) {
        FOR (j, 1, i - 1) {
            dp[i][j + 1] = (dp[i][j + 1] + dp[i - 1][j]) % mod;
            if (i == r) continue;
            dp[i][j] = (dp[i][j] + dp[i - 1][j] * j) % mod;
            dp[i][j - 1] = (dp[i][j - 1] + dp[i - 1][j] * (j * (j - 1) / 2 % mod)) % mod;
        }
    }
    cout << dp[n][1] << '\n';
}

int32_t main() {
    Waimai;
	solve();
}