#include <bits/stdc++.h>
clock_t t = clock();
namespace my_std {
using namespace std;
long long mod;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>
inline T rnd(T l, T r) {
  return uniform_int_distribution<T>(l, r)(rng);
}
template <typename T>
inline bool chkmax(T& x, T y) {
  return x < y ? x = y, 1 : 0;
}
template <typename T>
inline bool chkmin(T& x, T y) {
  return x > y ? x = y, 1 : 0;
}
template <typename T>
inline void read(T& t) {
  t = 0;
  char f = 0, ch = getchar();
  double d = 0.1;
  while (ch > '9' || ch < '0') f |= (ch == '-'), ch = getchar();
  while (ch <= '9' && ch >= '0') t = t * 10 + ch - 48, ch = getchar();
  if (ch == '.') {
    ch = getchar();
    while (ch <= '9' && ch >= '0') t += d * (ch ^ 48), d *= 0.1, ch = getchar();
  }
  t = (f ? -t : t);
}
template <typename T, typename... Args>
inline void read(T& t, Args&... args) {
  read(t);
  read(args...);
}
char __sr[1 << 21], __z[20];
int __C = -1, __zz = 0;
inline void Ot() { fwrite(__sr, 1, __C + 1, stdout), __C = -1; }
inline void print(register int x) {
  if (__C > 1 << 20) Ot();
  if (x < 0) __sr[++__C] = '-', x = -x;
  while (__z[++__zz] = x % 10 + 48, x /= 10)
    ;
  while (__sr[++__C] = __z[__zz], --__zz)
    ;
  __sr[++__C] = '\n';
}
void file() {}
inline void chktime() {}
long long ksm(long long x, int y) {
  long long ret = 1;
  for (; y; y >>= 1, x = x * x % mod)
    if (y & 1) ret = ret * x % mod;
  return ret;
}
long long inv(long long x) { return ksm(x, mod - 2); }
}  // namespace my_std
using namespace my_std;
long long fac[111], _fac[111];
void init() {
  _fac[0] = fac[0] = 1;
  for (int i = (1); i <= (111 - 1); i++)
    _fac[i] = inv(fac[i] = fac[i - 1] * i % mod);
}
int n, m, K;
long long pw[111][111 * 111];
long long f[111][111][111], g[111][111][111];
int main() {
  file();
  read(n, m, K, mod);
  init();
  for (int i = (0); i <= (K); i++)
    for (int j = (0); j <= (n * m); j++) pw[i][j] = ksm(i, j);
  f[K + 1][0][0] = 1;
  for (int i = (K); i >= (1); i--) {
    memcpy(g[i], f[i + 1], sizeof(g[i]));
    memset(f[i], 0, sizeof(f[i]));
    for (int j = (0); j <= (n); j++)
      for (int k = (0); k <= (m); k++)
        for (int l = (0); l <= (n - j); l++)
          (f[i][j + l][k] += g[i][j][k] * pw[K - i + 1][l * (m - k)] % mod *
                             _fac[l] % mod * pw[i][l * k] % mod) %= mod;
    memcpy(g[i], f[i], sizeof(g[i]));
    memset(f[i], 0, sizeof(f[i]));
    for (int j = (0); j <= (n); j++)
      for (int k = (0); k <= (m); k++)
        for (int l = (0); l <= (m - k); l++)
          (f[i][j][k + l] += g[i][j][k] * pw[K - i + 1][l * (n - j)] % mod *
                             _fac[l] % mod * pw[i][l * j] % mod) %= mod;
    if (i != 1) {
      memcpy(g[i], f[i], sizeof(g[i]));
      memset(f[i], 0, sizeof(f[i]));
      for (int j = (0); j <= (n); j++)
        for (int k = (0); k <= (m); k++)
          for (int l = (0); l <= (n - j); l++)
            (f[i][j + l][k] += g[i][j][k] * pw[K - i + 1][l * (m - k)] % mod *
                               _fac[l] % mod * ((l & 1) ? mod - 1 : 1) % mod *
                               pw[i - 1][l * k] % mod) %= mod;
    }
    if (i != 1) {
      memcpy(g[i], f[i], sizeof(g[i]));
      memset(f[i], 0, sizeof(f[i]));
      for (int j = (0); j <= (n); j++)
        for (int k = (0); k <= (m); k++)
          for (int l = (0); l <= (m - k); l++)
            (f[i][j][k + l] += g[i][j][k] * pw[K - i + 1][l * (n - j)] % mod *
                               _fac[l] % mod * ((l & 1) ? mod - 1 : 1) % mod *
                               pw[i - 1][l * j] % mod) %= mod;
    }
  }
  long long ans = fac[n] * fac[m] % mod * f[1][n][m] % mod;
  cout << ans;
  return 0;
}
