#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 ++) {
            int inv = inverse(i);
            for (int j = n; j; j --) {
                add(f[j], (long long) f[j - 1] * inv % p);
            }
        }
        printf("%d\n", f[n]);
    }
}

namespace Case2 {
    void solve() {

    }
}

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

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

    return 0;
}