#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(...) fprintf(stderr, ##__VA_ARGS__)
#else
#define endl "\n"
#define debug(...) void(0)
#endif
using LL = long long;
template <class T>
using must_int = enable_if_t<is_integral<T>::value, int>;
template <int id>
struct modint {/*{{{*/
  static int mod;
  static unsigned umod;
  static void setmod(int p) { mod = umod = p; }
  unsigned v;
  modint() : v(0) {}
  template <class T, must_int<T> = 0>
  modint(T x) {
    x %= mod;
    v = x < 0 ? x + mod : x;
  }
  modint operator+() const { return *this; }
  modint operator-() const { return modint() - *this; }
  friend int raw(const modint &self) { return self.v; }
  friend ostream& operator<<(ostream& os, const modint &self) { 
    return os << raw(self); 
  }
  modint &operator+=(const modint &rhs) {
    v += rhs.v;
    if (v >= umod) v -= umod;
    return *this;
  }
  modint &operator-=(const modint &rhs) {
    v -= rhs.v;
    if (v >= umod) v += umod;
    return *this;
  }
  modint &operator*=(const modint &rhs) {
    v = 1ull * v * rhs.v % umod;
    return *this;
  }
  modint &operator/=(const modint &rhs) {
    assert(rhs.v);
    return *this *= qpow(rhs, mod - 2);
  }
  template <class T, must_int<T> = 0>
  friend modint qpow(modint a, T b) {
    modint r = 1;
    for (; b; b >>= 1, a *= a)
      if (b & 1) r *= a;
    return r;
  }
  friend modint operator+(modint lhs, const modint &rhs) { return lhs += rhs; }
  friend modint operator-(modint lhs, const modint &rhs) { return lhs -= rhs; }
  friend modint operator*(modint lhs, const modint &rhs) { return lhs *= rhs; }
  friend modint operator/(modint lhs, const modint &rhs) { return lhs /= rhs; }
  bool operator==(const modint &rhs) const { return v == rhs.v; }
  bool operator!=(const modint &rhs) const { return v != rhs.v; }
};/*}}}*/
template <int id>
unsigned modint<id>::umod;
template <int id>
int modint<id>::mod;
using mint = modint<-1>;
int n, m;
mint f[410][410], pw[410][410], binom[410][410], a[410], inv[410];
int main() {
#ifndef LOCAL
  cin.tie(nullptr)->sync_with_stdio(false);
#endif
  cin >> n >> m >> mint::mod;
  mint::setmod(mint::mod);
  for (int i = 0; i <= n; i++) {
    pw[i][0] = binom[i][0] = 1;
    for (int j = 1; j <= n; j++) pw[i][j] = pw[i][j - 1] * i;
    for (int j = 1; j <= i; j++) binom[i][j] = binom[i - 1][j] + binom[i - 1][j - 1];
  }
  inv[1] = 1;
  for (int i = 2; i <= n; i++) inv[i] = -mint::mod / i * inv[mint::mod % i];
  for (int j = 1; j <= n; j++) {
    for (int i = 1; i <= n; i++) {
      f[i][j] = pw[j][i];
    }
  }
  for (int j = 1; j <= n; j++) {
//    mint now1 = 0, now2 = 0;
      mint now1[410] = {}, now2[410] = {};
      for (int i = 1; i <= n; i++) {
        for (int t = 1; t <= j; t++) f[i][j] -= now1[t] - now2[t];
        for (int t = 1; t <= j; t++) {
          now1[t] = (now1[t] + f[i][j - t + 1] - f[i][j - t]) * t;
          now2[t] = (now2[t] + f[i][j - t + 1] - f[i][j - t]) * (t - 1);
        }
        // for (int k = 1; k < i; k++) {
        //   f[i][j] -= (pw[t][k] - pw[t - 1][k]) * (f[i - k][j - t + 1] - f[i - k][j - t]);
        // }
      }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= i; j++) a[i] += binom[i][j] * ((i - j) & 1 ? -1 : +1) * f[n][j];
  }
  mint ans = 0;
  mint now = 1;
  for (int i = 1; i <= n; i++) {
    now *= m - i + 1;
    now *= inv[i];
    ans += now * a[i];
  }
  cout << ans << endl;
  return 0;
}