For each of the K^{NM} ways to write an integer between 1 and K (inclusive) in every square in a square grid with N rows and M columns, find the value defined below, then compute the sum of all those K^{NM} values, modulo D.

* For each of the NM squares, find the minimum among the N+M-1 integers written in the square's row or the square's column. The value defined for the grid is the product of all these NM values.

Constraints

* 1 \leq N,M,K \leq 100
* 10^8 \leq D \leq 10^9
* N,M,K, and D are integers.
* D is prime.

Input

Input is given from Standard Input in the following format:


N M K D


Output

Print the sum of the K^{NM} values, modulo D.

Examples

Input

2 2 2 998244353


Output

35


Input

2 3 4 998244353


Output

127090


Input

31 41 59 998244353


Output

827794103
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define uint unsigned
#define pii pair<int,int>
#define pll pair<ll,ll>
#define PB push_back
#define fi first
#define se second
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
#define Rep(i,j,k) for (int i=(int)(j);i>=(int)(k);i--)
#define CLR(a,v) memset(a,v,sizeof(a));
#define CPY(a,b) memcpy(a,b,sizeof(a));
using namespace std;
const int N=105;
int n,m,K,mo;
int C[N][N],f[N][N],g[N][N];
int power(int x,int y){
	int s=1;
	for (;y;y/=2,x=1ll*x*x%mo)
		if (y&1) s=1ll*s*x%mo;
	return s; 
}
int main(){
	//n=98; m=99; K=100; mo=998244353;
	scanf("%d%d%d%d",&n,&m,&K,&mo);
	For(i,0,N-1) C[i][0]=1;
	For(i,1,N-1) For(j,1,i)
		C[i][j]=(C[i-1][j-1]+C[i-1][j])%mo;
	f[0][0]=1;
	For(i,1,K){
		For(j,0,n) For(k,0,m) f[j][k]=1ll*f[j][k]*power(i,(n-j)*(m-k))%mo*power(K-i+1,mo-1-j*k)%mo;
		memset(g,0,sizeof(g));
		For(j,0,n) For(k,0,m) For(jj,0,n-j)
			g[j+jj][k]=(g[j+jj][k]+1ll*f[j][k]*C[jj+j][j])%mo;
		memset(f,0,sizeof(f));
		For(j,0,n) For(k,0,m) For(kk,0,m-k)
			f[j][k+kk]=(f[j][k+kk]+1ll*g[j][k]*C[kk+k][k])%mo;
		For(j,0,n) For(k,0,m) f[j][k]=1ll*f[j][k]*power(K-i+1,j*k)%mo;
		if (K!=i){
			For(j,0,n) For(k,0,m) f[j][k]=1ll*f[j][k]*power(K-i,mo-1-j*k)%mo;
			memset(g,0,sizeof(g));
			For(j,0,n) For(k,0,m) For(jj,0,n-j)
				g[j+jj][k]=(g[j+jj][k]+1ll*f[j][k]*(jj&1?mo-C[jj+j][j]:C[jj+j][j]))%mo;
			memset(f,0,sizeof(f));
			For(j,0,n) For(k,0,m) For(kk,0,m-k)
				f[j][k+kk]=(f[j][k+kk]+1ll*g[j][k]*(kk&1?mo-C[kk+k][k]:C[kk+k][k]))%mo;
			For(j,0,n) For(k,0,m) f[j][k]=1ll*f[j][k]*power(i,mo-1-(n-j)*(m-k))%mo*power(K-i,j*k)%mo;
		}
		/*For(j,0,n) For(k,0,m) if (f[j][k])
			printf("VF %d %d %d %d\n",i,j,k,f[j][k]);
		For(j,0,n) For(k,0,m) if (g[j][k])
			printf("VG %d %d %d %d\n",i,j,k,g[j][k]);*/
	}
	printf("%d",f[n][m]);
}