#include <bits/stdc++.h>

#define int long long

using namespace std;

const int kMaxN = 105;

int n, m, k, p;

int getPow(int x, int y) {
	int res = 1;
	while (y) {
		if (y & 1) res = res * x % p;
		x = x * x % p;
		y >>= 1;
	}
	return res;
}

void add(int &x, int y) {
	x += y;
	if (x >= p) x -= p;
	if (x < 0) x += p;
}

namespace Task1 {

int inv[kMaxN];

int f[kMaxN][kMaxN];

int ans;

void main() {
	for (int i = 1; i <= m; ++i) {
		inv[i] = getPow(i, p - 2);
	}
	f[0][0] = 1;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			for (int k = 0; k < j; ++k) {
				add(f[i][j], f[i - 1][k] * inv[j] % p);
			}
		}
	}
	for (int i = 1; i <= m; ++i) add(ans, f[n][i]);
	cout << ans << '\n';
}

}

namespace Task2 {

const int kMaxN = 75;

int a1;

int inv[kMaxN * kMaxN];

int f[kMaxN][kMaxN][kMaxN * kMaxN];

int ans;

void work() {
	memset(f, 0, sizeof(f));
	f[0][0][a1] = 1;
	for (int i = 1; i <= m; ++i) {
		for (int j = 0; j < n; ++j) {
			for (int k = a1; k <= n * m; ++k) {
				// 没有取到 T 中
				add(f[i][j][k], f[i - 1][j][k]);
				if (i != a1) {
					// 取到 T 中但没取到 S 中
					if (j)
						add(f[i][j][k], f[i - 1][j - 1][k] * inv[i] % p);
					// 取到 T 中并且取到 S 中
					if (j && k >= i) 
						add(f[i][j][k], -f[i - 1][j - 1][k - i] * inv[i] % p);
				}
				//cout << i << ' ' << j << ' ' << k << ' ' << f[i][j][k] << '\n';
			}
		}
	}
	int res = 0;
	for (int s = a1; s <= n * m; ++s) {
		add(res, f[m][n - 1][s] * inv[s] % p);
	}
	add(ans, res * a1 % p);
}

void main() {
	for (int i = 1; i <= n * m; ++i) inv[i] = getPow(i, p - 2);
	for (a1 = 1; a1 <= m; ++a1) {
		work();
	}
	cout << ans << '\n';
}

}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	
	cin >> n >> m >> k >> p;
	if (k == 1) Task1::main();
	else Task2::main();
	
	return 0;
}