#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsigned int
#define ull unsigned long long 
#define i128 __int128
using namespace std;
const int N = 107;
int mod;
int qpow(int x, int y = mod - 2) {
	int res = 1;
	for(; y; x = (ll) x * x % mod, y >>= 1) if(y & 1) res = (ll) res * x % mod;
	return res;
}
int fac[N], ifac[N], inv[N];
void init(int x) {
	fac[0] = ifac[0] = inv[1] = 1;
	L(i, 2, x) inv[i] = (ll) (mod - mod / i) * inv[mod % i] % mod;
	L(i, 1, x) fac[i] = (ll) fac[i - 1] * i % mod, ifac[i] = (ll) ifac[i - 1] * inv[i] % mod;
} 
int C(int x, int y) {
	return x < y || y < 0 ? 0 : (ll) fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}
inline int sgn(int x) {
	return (x & 1) ? mod - 1 : 1;
}
int n, m, k;
namespace solve1 {
	int dp[N], ndp[N];
	void slv() {
		dp[0] = 1;
		L(i, 1, m) {
			me(ndp, 0);
			L(j, 0, i) {
				(ndp[j] += dp[j]) %= mod;
				(ndp[j + 1] += (ll) dp[j] * inv[i] % mod) %= mod;
			}
			swap(dp, ndp);
		}
		cout << dp[n] << '\n';
	}
}
namespace solve2 {
	int dp[2][N][N * N / 2];
	int ndp[2][N][N * N / 2];
	void slv() {
		dp[0][0][0] = 1;
		L(i, 1, m) {
			me(ndp, 0);
			L(o, 0, 1) 
				L(j, 0, i) L(k, 0, i * (i - 1) / 2) if(dp[o][j][k]) {
					(ndp[o][j][k] += dp[o][j][k]) %= mod;
					(ndp[o][j + 1][k + i] += mod - (ll) dp[o][j][k] * inv[i] % mod) %= mod;
					(ndp[o][j + 1][k] += (ll) dp[o][j][k] * inv[i] % mod) %= mod;
				}
			L(j, 0, i) L(k, 0, i * (i - 1) / 2) if(dp[0][j][k]) {
				(ndp[1][j + 1][k + i] += (ll)dp[0][j][k] * i % mod) %= mod;
			}
			swap(dp, ndp);
		}
		int ans = 0;
		L(i, 1, m * (m + 1) / 2)
		 	if(dp[1][n][i]) 
		 		(ans += (ll) dp[1][n][i] * qpow(i) % mod) %= mod;
		cout << ans << '\n';
	}
	/*
	2 2 2 1000000007

	*/
}

int main () {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> m >> k >> mod;
	init(m + 1);
	if(k == 1) {
		solve1 :: slv();
	} else {
		solve2 :: slv();
	}
	return 0;
}