#include <bits/stdc++.h>
using namespace std;
namespace io {
const int SI = 1 << 21 | 1;
char IB[SI], *IS, *IT, OB[SI], *OS = OB, *OT = OS + SI - 1, c, ch[100];
int f, t;
inline void flush() { fwrite(OB, 1, OS - OB, stdout), OS = OB; }
inline void pc(char x) {
  *OS++ = x;
  if (OS == OT) flush();
}
template <class I>
inline void rd(I &x) {
  for (f = 1, c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),
                              IS == IT ? EOF : *IS++)
                            : *IS++);
       c < '0' || c > '9';
       c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),
                       IS == IT ? EOF : *IS++)
                     : *IS++))
    if (c == '-') f = -1;
  for (x = 0; c >= '0' && c <= '9'; x = (x << 3) + (x << 1) + (c & 15),
      c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),
                      IS == IT ? EOF : *IS++)
                    : *IS++))
    ;
  x *= f;
}
template <class I>
inline void rd(I &x, I &y) {
  rd(x), rd(y);
}
template <class I>
inline void rd(I &x, I &y, I &z) {
  rd(x), rd(y), rd(z);
}
template <class I>
inline void rda(I *a, int n) {
  for (int i = 1; i <= n; i++) rd(a[i]);
}
inline void rdc(char &c) {
  for (c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),
                       IS == IT ? EOF : *IS++)
                     : *IS++);
       c < 33 || c > 126;
       c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),
                       IS == IT ? EOF : *IS++)
                     : *IS++))
    ;
}
inline void rds(char *s, int &n) {
  for (c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),
                       IS == IT ? EOF : *IS++)
                     : *IS++);
       c < 33 || c > 126;
       c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),
                       IS == IT ? EOF : *IS++)
                     : *IS++))
    ;
  for (n = 0; c >= 33 && c <= 126;
       s[++n] = c, c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),
                                   IS == IT ? EOF : *IS++)
                                 : *IS++))
    ;
  s[n + 1] = '\0';
}
inline void rds(string &s) {
  for (c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),
                       IS == IT ? EOF : *IS++)
                     : *IS++);
       c < 33 || c > 126;
       c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),
                       IS == IT ? EOF : *IS++)
                     : *IS++))
    ;
  for (s.clear(); c >= 33 && c <= 126;
       s.push_back(c),
       c = (IS == IT ? (IT = (IS = IB) + fread(IB, 1, SI, stdin),
                       IS == IT ? EOF : *IS++)
                     : *IS++))
    ;
}
template <class I>
inline void print(I x, char k = '\n') {
  if (!x) pc('0');
  if (x < 0) pc('-'), x = -x;
  while (x) ch[++t] = x % 10 + '0', x /= 10;
  while (t) pc(ch[t--]);
  pc(k);
}
template <class I>
inline void print(I x, I y) {
  print(x, ' '), print(y);
}
template <class I>
inline void print(I x, I y, I z) {
  print(x, ' '), print(y, ' '), print(z);
}
template <class I>
inline void printa(I *a, int n) {
  for (int i = 1; i <= n; i++) print(a[i], " \n"[i == n]);
}
inline void printc(char c) { pc(c); }
inline void prints(char *s, int n) {
  for (int i = 1; i <= n; i++) pc(s[i]);
  pc('\n');
}
inline void prints(string s) {
  int n = s.length();
  while (t < n) pc(s[t++]);
  pc('\n'), t = 0;
}
struct Flush {
  ~Flush() { flush(); }
} flusher;
}  // namespace io
using io::print;
using io::printa;
using io::printc;
using io::prints;
using io::rd;
using io::rda;
using io::rdc;
using io::rds;
int P;
struct modint {
  int x;
  inline modint(int x = 0) : x(x) {}
  inline modint &operator=(int o) { return x = o, *this; }
  inline modint &operator+=(modint o) {
    return (x += o.x) >= P && (x -= P), *this;
  }
  inline modint &operator-=(modint o) {
    return (x -= o.x) < 0 && (x += P), *this;
  }
  inline modint &operator*=(modint o) { return x = 1ll * x * o.x % P, *this; }
  inline modint &operator^=(long long b) {
    modint a = *this, c;
    if (!~b) b = P - 2;
    c.x = 1 % P;
    while (b) {
      if (b & 1) c *= a;
      a *= a, b >>= 1;
    }
    return x = c.x, *this;
  }
  inline modint &operator/=(modint o) { return *this *= o ^ -1; }
  inline modint &operator+=(int o) { return (x += o) >= P && (x -= P), *this; }
  inline modint &operator-=(int o) { return (x -= o) < 0 && (x += P), *this; }
  inline modint &operator*=(int o) { return x = 1ll * x * o % P, *this; }
  inline modint &operator/=(int o) { return *this *= (modint)o ^ -1; }
  template <class I>
  inline friend modint operator+(modint a, I b) {
    return a += b;
  }
  template <class I>
  inline friend modint operator-(modint a, I b) {
    return a -= b;
  }
  template <class I>
  inline friend modint operator*(modint a, I b) {
    return a *= b;
  }
  inline friend modint operator^(modint a, long long b) { return a ^= b; }
  template <class I>
  inline friend modint operator/(modint a, I b) {
    return a /= b;
  }
  inline friend bool operator==(modint a, int b) { return a.x == b; }
  inline friend bool operator!=(modint a, int b) { return a.x != b; }
  inline friend bool operator<(modint a, int b) { return a.x < b; }
  inline friend bool operator<=(modint a, int b) { return a.x <= b; }
  inline friend bool operator>(modint a, int b) { return a.x > b; }
  inline friend bool operator>=(modint a, int b) { return a.x >= b; }
  inline friend bool operator==(modint a, modint b) { return a.x == b.x; }
  inline friend bool operator!=(modint a, modint b) { return a.x != b.x; }
  inline friend bool operator<(modint a, modint b) { return a.x < b.x; }
  inline friend bool operator<=(modint a, modint b) { return a.x <= b.x; }
  inline friend bool operator>(modint a, modint b) { return a.x > b.x; }
  inline friend bool operator>=(modint a, modint b) { return a.x >= b.x; }
  inline bool operator!() { return !x; }
  inline modint operator-() { return x ? P - x : 0; }
};
inline void rd(modint &x) { rd(x.x); }
inline void print(modint x, char k = '\n') { print(x.x, k); }
const int NP = 1e6 + 7;
modint p[NP], v[NP], vp[NP];
inline void init(int n) {
  p[0] = v[0] = 1;
  for (int i = 1; i <= n; i++) p[i] = p[i - 1] * i;
  vp[n] = 1 / p[n];
  for (int i = n; i; i--) v[i] = vp[i] * p[i - 1], vp[i - 1] = vp[i] * i;
}
inline modint binom(int n, int m) {
  return (m < 0 || n < m) ? 0 : p[n] * vp[m] * vp[n - m];
}
const int N = 107;
int n, m, k;
modint f[N << 2][N][N], g[N][N * N], c[N][N];
int main() {
  rd(n, m, k), rd(P);
  init(max(n, m));
  for (int i = 0; i <= k; i++) {
    g[i][0] = 1;
    for (int j = 1; j <= n * m; j++) g[i][j] = g[i][j - 1] * i;
  }
  for (int i = 0; i <= max(n, m); i++)
    for (int j = 0; j <= i; j++) c[i][j] = binom(i, j);
  f[0][0][0] = 1;
  for (int t = 1, o = 0; t <= k; t++) {
    for (int i = 0; i <= n; i++)
      for (int j = 0; j <= m; j++)
        if (!!f[o][i][j]) {
          modint x = f[o][i][j], y = g[k - t + 1][j] * g[t][m - j];
          for (int p = 0; i + p <= n; p++, x *= y)
            f[o + 1][i + p][j] += c[n - i][p] * x;
        }
    ++o;
    for (int i = 0; i <= n; i++)
      for (int j = 0; j <= m; j++)
        if (!!f[o][i][j]) {
          modint x = f[o][i][j], y = g[k - t + 1][i] * g[t][n - i];
          for (int q = 0; j + q <= m; q++, x *= y)
            f[o + 1][i][j + q] += c[m - j][q] * x;
        }
    ++o;
    for (int i = 0; i <= n; i++)
      for (int j = 0; j <= m; j++)
        if (!!f[o][i][j]) {
          modint x = f[o][i][j], y = -g[k - t][j] * g[t][m - j];
          for (int u = 0; i + u <= n; u++, x *= y)
            f[o + 1][i + u][j] += c[n - i][u] * x;
        }
    ++o;
    for (int i = 0; i <= n; i++)
      for (int j = 0; j <= m; j++)
        if (!!f[o][i][j]) {
          modint x = f[o][i][j], y = -g[k - t][i] * g[t][n - i];
          for (int v = 0; j + v <= m; v++, x *= y)
            f[o + 1][i][j + v] += c[m - j][v] * x;
        }
    ++o;
  }
  print(f[k << 2][n][m]);
  return 0;
}
