four=((0,1),(1,0),(0,-1),(-1,0))
cnt=0
def pos(x,y):
    return x*W+y
def dfs(i1,i2):
    global cnt
    ad=[]
    nc=0
    for i in range(H):
        for j in range(W):
            if (i1>>pos(i,j))&1:
                nc+=1
                continue
            flg=False
            for dx,dy in four:
                nx=i+dx
                ny=j+dy
                if nx<0 or H<=nx or ny<0 or W<=ny:
                    continue
                if (i1>>pos(nx,ny))&1:
                    nc+=1
                    flg=True
                    break
            if (i2>>pos(i,j))&1:
                continue
            if flg:
                i2+=1<<pos(i,j)
                dfs(i1+(1<<pos(i,j)),i2)
    cnt+=rest[H*W-nc]*sz[i1.bit_count()]
H,W,K,M=map(int,input().split())
rest=[0]*(H*W+1)
sz=[0]*(H*W+1)
for i in range(H*W+1):
	rest[i]=pow(2,i,M)
	sz[i]=pow(i,K,M)
for i in range(H*W):
    dfs(1<<i,(1<<(i+1))-1)
ans=0
for i in range(H*W):
    ans+=cnt*pow(2,-H*W,M)*pow(i+1,-1,M)
    ans%=M
print(ans)