#include<bits/stdc++.h>
#define int ll
#define ll long long
#define db double
#define MP make_pair
#define vec vector<int>
#define pii pair<int,int>
#define pb emplace_back
#define fi first
#define se second
#define ls k<<1
#define rs k<<1|1
#define CLK (double)clock()/CLOCKS_PER_SEC
using namespace std;
mt19937 rnd(time(0));
int read(){
    int x=0,f=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
    return x*f;
}
void write(int x){
    if(x<0){putchar('-');write(-x);}
    else {
        if(x>9)write(x/10);
        putchar(x%10+'0');
    }
}
const int N=105;
int n,m,k,mod,inv[N*N];
void add(int &x,int y){x+=y;if(x>=mod)x-=mod;}
void init(int n){
    inv[0]=inv[1]=1;
    for(int i=2;i<=n;i++)inv[i]=(mod-mod/i)*inv[mod%i]%mod;
}
int f[N][N];
void Solve1(){
    f[0][0]=1;
    for(int i=1;i<=m;i++)for(int j=0;j<i;j++){
        add(f[i][j],f[i-1][j]);
        add(f[i][j+1],f[i-1][j]*inv[i]%mod);
    }
    cout<<f[m][n]<<"\n";
}
int g[2][N][N*N][2],p;
void New(){p^=1;memset(g[p],0,sizeof g[p]);}
void Solve2(){
    g[p][0][0][0]=1;//valspace,cnt_S,sum_T,had a_1
    int s=0,ans=0;
    for(int i=1;i<=m;s+=i,i++){
        New();
        for(int j=0;j<i;j++)for(int k=0;k<=s;k++)
        for(int l=0;l<2;l++)if(g[p^1][j][k][l]){
            int res=g[p^1][j][k][l];
            add(g[p][j][k][l],res);
            add(g[p][j+1][k][l],res*inv[i]%mod);
            add(g[p][j+1][k+i][l],(mod-res)*inv[i]%mod);
            if(!l)add(g[p][j+1][k+i][1],res*i%mod);
        }
    }
    for(int i=0;i<=s;i++)if(g[p][n][i][1])
        add(ans,g[p][n][i][1]*inv[i]%mod);
    cout<<(ans+mod)%mod<<"\n";
}
void MAIN(){
    n=read(),m=read(),k=read(),mod=read();init(10000);
    if(k==1)Solve1();
    else Solve2();
}
signed main(){
  //  freopen("read.in","r",stdin);
    //freopen("write.out","w",stdout);
    int T=1;while(T--)MAIN();
    // printf("\nTIME:%lf\n",CLK);
    return 0;
}
// g++ qoj7774.cpp -o qoj7774 -std=c++14 -O2