#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 105;
int n,m,k,mod,lst,now;
ll f[2][N],inv[N*N];
ll g[2][N][N*N][2];
void solve1()
{
    lst = 1;
    f[now][0] = 1;
    for(int i = 1;i <= m;i++)
    {
        swap(now,lst);
        memset(f[now],0,sizeof(f[now]));
        for(int j = 0;j <= n;j++)
        {
            if(!f[lst][j]) continue;
            f[now][j] = (f[now][j] + f[lst][j])%mod;
            if(j < n) f[now][j+1] = (f[now][j+1] + f[lst][j]*inv[i])%mod;
        }
    }
    cout<<f[now][n]<<"\n";
}
void solve2()
{
    lst = 1;
    g[now][0][0][0] = 1;
    for(int i = 1;i <= m;i++)
    {
        swap(now,lst);
        memset(g[now],0,sizeof(g[now]));
        for(int j = 0;j <= n;j++)
        {
            for(int k = 0;k <= n*m;k++)
            {
                for(int l = 0;l < 2;l++)
                {
                    if(!g[lst][j][k][l]) continue;
                    g[now][j][k][l] = (g[now][j][k][l] + g[lst][j][k][l])%mod;
                    //选做a1
                    if(l == 0 && j < n) g[now][j+1][k+i][1] = (g[now][j+1][k+i][0] + g[lst][j][k][0]*i)%mod;
                    //被容斥
                    if(j < n) g[now][j+1][k+i][l] = (g[now][j+1][k+i][l] + g[lst][j][k][l]*(mod-inv[i]))%mod;
                    //不被容斥
                    if(j < n) g[now][j+1][k][l] = (g[now][j+1][k][l] + g[lst][j][k][l]*inv[i])%mod;
                }
            }
        }
    }
    ll res = 0;
    for(int k = 0;k <= n*m;k++) res = (res + g[now][n][k][1] * inv[k])%mod;
    cout<<res<<"\n";
}
int main()
{
    ios::sync_with_stdio(false);cin.tie(0);
    cin>>n>>m>>k>>mod;
    inv[1] = 1;
    for(int i = 2;i <= n*m;i++) inv[i] = mod - mod/i*inv[mod%i]%mod;
    if(k == 1) solve1();
    if(k == 2) solve2();
    return 0;
}