#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int maxn = 110;

int n, m, k, mod, f[maxn][maxn], g[2][maxn][maxn * maxn][2], inv[maxn * maxn];

inline void add(int &x, int y) { x += y; if (x >= mod) x -= mod; }
inline void sub(int &x, int y) { x -= y; if (x < 0) x += mod; }
inline int Add(int x, int y) { x += y; if (x >= mod) x -= mod; return x; }
inline int Sub(int x, int y) { x -= y; if (x < 0) x += mod; return x; }

inline int fpw(int a, int p) {
  int res = 1;
  while (p) {
    if (p & 1) res = 1ll * res * a % mod;
    a = 1ll * a * a % mod, p >>= 1;
  }
  return res;
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n >> m >> k >> mod;
  rep (i, 1, m * (m + 1) / 2) inv[i] = fpw(i, mod - 2);
  if (k == 1) {
    f[0][0] = 1;
    rep (i, 1, m) rep (j, 0, n) {
      add(f[i][j], f[i - 1][j]);
      if (j) add(f[i][j], 1ll * f[i - 1][j - 1] * inv[i] % mod);
    }
    cout << f[m][n] << '\n';
  } else {
    g[0][0][0][0] = 1;
    rep (i, 1, m) {
      rep (j, 0, m) rep (k, 0, m * (m + 1) / 2) rep (p, 0, 1) g[i & 1][j][k][p] = 0;
      rep (j, 0, m) rep (k, 0, m * (m + 1) / 2) rep (p, 0, 1) {
        if (!g[(i & 1) ^ 1][j][k][p]) continue;
        add(g[i & 1][j][k][p], g[(i & 1) ^ 1][j][k][p]); // 不放入 S
        add(g[i & 1][j + 1][k][p], 1ll * g[(i & 1) ^ 1][j][k][p] * inv[i] % mod); // 放入 S，不放入 T
        sub(g[i & 1][j + 1][k + i][p], 1ll * g[(i & 1) ^ 1][j][k][p] * inv[i] % mod); // 放入 T
        if (!p) add(g[i & 1][j + 1][k + i][1], 1ll * g[(i & 1) ^ 1][j][k][p] * i % mod); // a1
      }
    }
    int ans = 0;
    rep (i, 1, m * (m + 1) / 2) add(ans, 1ll * g[m & 1][n][i][1] * inv[i] % mod);
    cout << ans << '\n';
  }
}