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

const int maxn = 310;
int n, K, P, f[maxn][maxn], s[maxn][maxn], C[maxn][maxn];

int main() {
    scanf("%d %d %d", &n, &K, &P);
    for (int i = 0; i <= n; i++) {
        for (int j = C[i][0] = 1; j <= i; j++) {
            C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % P;
        }
    }
    for (int i = 0; i <= K; i++) {
        f[1][i] = 1, s[1][i] = K - i + 1;
    }
    for (int i = 2; i <= n + 1; i++) {
        for (int j = 1; j < i; j++) {
            for (int k = 0; k <= K; k++) {
                f[i][k] = (f[i][k] + 1LL * f[i - j][k] * s[j][k + 1] % P * C[i - 2][j - 1]) % P;
            }
        }
        for (int j = K; j; j--) s[i][j] = (s[i][j + 1] + f[i][j]) % P;
    }
    printf("%d\n", f[n + 1][0]);
    return 0;
}