#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=100+5,M=8e5+5,K=(1<<25)+5,mod=1e9+9,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,m,k,p,lim;ll inv[N*N];
namespace Solve1{
	ll f[N][N];
	void solve(){
		int i,j;f[0][0]=1;
		for(i=1;i<=m;i++){
			for(j=0;j<=n;j++) f[i][j]=f[i-1][j];
			for(j=1;j<=n;j++) f[i][j]=(f[i-1][j-1]*inv[i]+f[i-1][j])%p;
		}
		printf("%lld\n",f[m][n]);
	}
}
namespace Solve2{
	ll f[N][N*N/2][2],g[N][N*N/2][2];
	void solve(){
		int i,j,h;lim=n*(m+m-n+1)/2;
		f[0][0][0]=1;
		for(i=1;i<=m;i++){
			Mc(g,f);
			for(j=1;j<=n&&j<=i;j++) {
				int l2=(i+i-j+1)*j/2;
				for(h=0;h<=l2;h++) for(int o=0;o<2;o++) f[j][h][o]=(f[j][h][o]+g[j-1][h][o]*inv[i])%p;
				for(h=i;h<=l2;h++) for(int o=0;o<2;o++) f[j][h][o]=(f[j][h][o]+g[j-1][h-i][o]*(p-inv[i])%p)%p;
				for(h=i;h<=l2;h++) f[j][h][1]=(f[j][h][1]+g[j-1][h-i][0]*i)%p;
			}
		}
		ll ans=0;for(i=0;i<=lim;i++) ans+=f[n][i][1]*inv[i]%p;
		printf("%lld\n",ans%p);
	}
}
void Solve(){
	int i,j,h;scanf("%d%d%d%d",&n,&m,&k,&p);
	inv[0]=inv[1]=1;for(i=2;i<=n*m;i++) inv[i]=(p-inv[p%i])*(p/i)%p;
	if(k==1) Solve1::solve();
	else Solve2::solve();
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}