#include <bits/stdc++.h>
using namespace std;
int mo;
const int N = 405;
int n, K, ipw[N][N], pw[N][N];
int sf[N][N], f[N][N], h[N], binom[N][N];

int main() {
  scanf("%d%d%d", &n, &K, &mo);
  ipw[1][1] = 1;
  for (int i = 2; i <= n; i++)
    ipw[i][1] = mo - 1ll * (mo / i) * ipw[mo % i][1] % mo;
  for (int i = 1; i <= n; i++) {
    ipw[i][0] = pw[i][0] = 1, pw[i][1] = i;
    for (int j = 2; j <= n; j++) {
      ipw[i][j] = 1ll * ipw[i][j - 1] * ipw[i][1] % mo;
      pw[i][j] = 1ll * pw[i][j - 1] * i % mo;
    }
  }
  for (int i = 0; i <= n; i++)
    for (int j = binom[i][0] = 1; j <= i; j++)
      binom[i][j] = (binom[i - 1][j - 1] + binom[i - 1][j]) % mo;

  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      f[i][j] = pw[j][i];
      for (int k = 1; k <= j; k++) {
        f[i][j] = (f[i][j]                                                             //
                   - 1ll * pw[k][i] * (sf[j - k + 1][k] - sf[j - k][k] + mo) % mo + mo //
                   + 1ll * pw[k - 1][i] * (sf[j - k + 1][k - 1] - sf[j - k][k - 1] + mo)) %
                  mo;
      }
    }
    for (int j = 1; j <= n; j++)
      for (int k = 1; k <= n; k++)
        sf[j][k] = (sf[j][k] + 1ll * f[i][j] * ipw[k][i]) % mo;
  }
  int res = 1, ans = 0;
  for (int i = 1; i <= n; i++) {
    res = 1ll * res * (K - i + 1) % mo * ipw[i][1] % mo;
    h[i] = f[n][i];
    for (int j = 1; j < i; j++)
      (h[i] += mo - 1ll * h[j] * binom[i][j] % mo) %= mo;
    ans = (ans + 1ll * h[i] * res) % mo;
  }
  printf("%d\n", ans);
}