#include <cstdio>

constexpr int maxn = 100 + 5;

int n, m, p;

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

int quick_power(int x, int k) {
    int ret = 1;
    for (;;) {
        if (k & 1) {
            ret = (long long) ret * x % p;
        }
        if (!(k >>= 1)) {
            break;
        }
        x = (long long) x * x % p;
    }
    return ret;
}

int inverse(int x) {
    return quick_power(x, p - 2);
}

namespace Case1 {
    int f[maxn];

    void solve() {
        f[0] = 1;

        for (int i = 1; i <= m; i ++) {
            long long inv = inverse(i);

            for (int j = n; j; j --) {
                add(f[j], f[j - 1] * inv % p);
            }
        }

        printf("%d\n", f[n]);
    }
}

namespace Case2 {
    int f[maxn][maxn * maxn][2];

    void solve() {
        int ans = 0;
        f[0][0][0] = 1;

        for (int i = 1; i <= m; i ++) {
            long long inv = inverse(i);

            for (int j = n; j; j --) {
                for (int k = i * (i + 1) / 2; k >= 0; k --) {
                    for (int op = 0; op < 2; op ++) {
                        add(f[j][k][op], (f[j - 1][k][op] + (i <= k ?
                            p - f[j - 1][k - i][op] : 0)) * inv % p);
                    }
                    if (i <= k) {
                        add(f[j][k][1], (long long) f[j - 1][k - i][0] * i % p);
                    }
                }
            }
        }

        for (int i = 0; i <= m * (m + 1) / 2; i ++) {
            add(ans, (long long) f[n][i][1] * inverse(i) % p);
        }

        printf("%d\n", ans);
    }
}

int main() {
    int k;
    scanf("%d%d%d%d", &n, &m, &k, &p);

    if (k == 1) {
        Case1::solve();
    } else {
        Case2::solve();
    }

    return 0;
}