#include <bits/stdc++.h>
using namespace std;
const int NN = 117;
const int MM = 100 + 117;
int read() {
  int fl = 1, x;
  char c;
  for (c = getchar(); (c < '0' || c > '9') && c != '-'; c = getchar())
    ;
  if (c == '-') {
    fl = -1;
    c = getchar();
  }
  for (x = 0; c >= '0' && c <= '9'; c = getchar())
    x = (x << 3) + (x << 1) + c - '0';
  return x * fl;
}
void open() { freopen("a.in", "r", stdin); }
void close() {
  fclose(stdin);
  fclose(stdout);
}
int m, n, s;
long long dp[NN][NN][NN] = {};
long long tp[NN][NN] = {};
long long mod;
long long fact[NN] = {};
long long rev[NN] = {};
long long mi[NN][NN * NN] = {};
long long ksm(long long a, long long b) {
  long long ret = 1;
  for (; b; b >>= 1, a = a * a % mod)
    if (b & 1) ret = ret * a % mod;
  return ret;
}
void prefact(int n) {
  fact[0] = 1;
  for (int i = 1; i <= n; ++i) {
    fact[i] = fact[i - 1] * i % mod;
  }
  rev[n] = ksm(fact[n], mod - 2);
  for (int i = n; i >= 1; --i) {
    rev[i - 1] = rev[i] * i % mod;
  }
}
long long c[NN][NN] = {};
int main() {
  open();
  n = read();
  m = read();
  s = read();
  mod = read();
  prefact(max(n, m));
  for (int i = 0; i <= s; ++i) {
    mi[i][0] = 1;
    for (int j = 1; j <= n * m; ++j) {
      mi[i][j] = mi[i][j - 1] * i % mod;
    }
  }
  dp[1][n][m] = 1;
  for (int i = 1; i <= s; ++i) {
    for (int j = 0; j <= n; ++j) {
      for (int l = 0; l <= m; ++l) {
        c[j][l] =
            rev[l] * mi[i][j * l] % mod * mi[s - i + 1][(n - j) * l] % mod;
      }
    }
    for (int j = 0; j <= n; ++j) {
      for (int k = 0; k <= m; ++k) {
        tp[j][k] = 0;
        for (int l = 0; l + k <= m; ++l) {
          tp[j][k] += dp[i][j][k + l] * c[j][l];
          tp[j][k] %= mod;
        }
      }
    }
    for (int l = 0; l <= n; ++l) {
      for (int k = 0; k <= m; ++k) {
        c[l][k] =
            rev[l] * mi[i][k * l] % mod * mi[s - i + 1][(m - k) * l] % mod;
      }
    }
    for (int j = 0; j <= n; ++j) {
      for (int k = 0; k <= m; ++k) {
        dp[i][j][k] = 0;
        for (int l = 0; l + j <= n; ++l) {
          dp[i][j][k] += tp[j + l][k] * c[l][k];
          dp[i][j][k] %= mod;
        }
      }
    }
    for (int j = 0; j <= n; ++j) {
      for (int l = 0, sym = 1; l <= m; ++l, sym = -sym) {
        c[j][l] =
            rev[l] * mi[i][j * l] * sym % mod * mi[s - i][(n - j) * l] % mod;
      }
    }
    for (int j = 0; j <= n; ++j) {
      for (int k = 0; k <= m; ++k) {
        tp[j][k] = 0;
        for (int l = 0; l + k <= m; ++l) {
          tp[j][k] += dp[i][j][k + l] * c[j][l];
          tp[j][k] %= mod;
        }
      }
    }
    for (int l = 0, sym = 1; l <= n; ++l, sym = -sym) {
      for (int k = 0; k <= m; ++k) {
        c[l][k] =
            rev[l] * mi[i][k * l] * sym % mod * mi[s - i][(m - k) * l] % mod;
      }
    }
    for (int j = 0; j <= n; ++j) {
      for (int k = 0; k <= m; ++k) {
        dp[i + 1][j][k] = 0;
        for (int l = 0; l + j <= n; ++l) {
          dp[i + 1][j][k] += tp[j + l][k] * c[l][k];
          dp[i + 1][j][k] %= mod;
        }
      }
    }
  }
  long long ans = dp[s + 1][0][0] * fact[n] % mod * fact[m] % mod;
  ans = (ans + mod) % mod;
  printf("%lld\n", ans);
  close();
  return 0;
}
