#include<iostream>
#include<cstdio>
#define N 100
#define M 10000
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int n,m,k,mod,ans,inv[M+1],dp[N+1][N+1],DP[2][N+1][M+1][2];
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int main()
{
	int opt=0;
	n=read(),m=read(),k=read(),mod=read(),inv[1]=1;
	for (int i=2;i<=M;++i) inv[i]=MD2(-1ll*(mod/i)*inv[mod%i]%mod);
	if (k==1)
	{
		for (int i=0;i<=m;++i) dp[0][i]=1;
		for (int i=1;i<=n;++i)
			for (int j=1;j<=m;++j)
				dp[i][j]=MD(dp[i][j-1]+1ll*dp[i-1][j-1]*inv[j]%mod);
		printf("%d\n",dp[n][m]);
	}
	else
	{
		for (int i=0;i<=m;++i) DP[0][i][0][0]=MD2(-1);
		for (int i=1;i<=n;++i)
		{
			opt^=1;
			for (int j=0;j<=m;++j)
				for (int k=0;k<=n*m;++k)
					for (int op=0;op<=1;++op)
						DP[opt][j][k][op]=0;
			for (int j=1;j<=m;++j)
				for (int k=0;k<=n*m;++k)
				{
					for (int op=0;op<=1;++op) Adder(DP[opt][j][k][op],DP[opt][j-1][k][op]),Adder(DP[opt][j][k][op],1ll*DP[opt^1][j-1][k][op]*inv[j]%mod);
					if (k>=j)
					{
						Adder2(DP[opt][j][k][1],-1ll*DP[opt^1][j-1][k-j][0]*j%mod);
						for (int op=0;op<=1;++op) Adder2(DP[opt][j][k][op],-1ll*DP[opt^1][j-1][k-j][op]*inv[j]%mod);
					}
				}
		}
		for (int i=1;i<=n*m;++i) Adder(ans,1ll*DP[opt][m][i][1]*inv[i]%mod);
		printf("%d\n",ans);
	}
	return 0;
}