#include <bits/stdc++.h>

#define int long long

using namespace std;

const int kMaxN = 105;

int n, m, k, p;

int inv[kMaxN];

int f[kMaxN][kMaxN];

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;
}

int ans;

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	
	cin >> n >> m >> k >> p;
	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';
	return 0;
}