import sys
input = sys.stdin.readline


H,W,N,D=map(int,input().split())

P=[list(map(int,input().split())) for i in range(N)]

for i in range(N):
    P[i][0]-=1
    P[i][1]-=1

MAP=[-1]*(H*W)

for i in range(N):
    if 0<=P[i][0]*W+P[i][1]<H*W:
        MAP[P[i][0]*W+P[i][1]]=i

# UnionFind

Group = [i for i in range(N)] # グループ分け
Nodes = [1]*(N) # 各グループのノードの数

def find(x):
    while Group[x] != x:
        x=Group[x]
    return x

def Union(x,y):
    if find(x) != find(y):
        if Nodes[find(x)] < Nodes[find(y)]:
            
            Nodes[find(y)] += Nodes[find(x)]
            Nodes[find(x)] = 0
            Group[find(x)] = find(y)
            
        else:
            Nodes[find(x)] += Nodes[find(y)]
            Nodes[find(y)] = 0
            Group[find(y)] = find(x)

DS=[]
for i in range(-D,D+1):
    for j in range(-D,D+1):
        if abs(i)+abs(j)<=D:
            if i==0 and j==0:
                continue
            DS.append((i,j))

for i in range(N):
    x,y=P[i]

    for dx,dy in DS:
        z,w=x+dx,y+dy
        if 0<=z<H and 0<=w<W and 0<=z*W+w<H*W and MAP[z*W+w]!=-1:
            k=MAP[z*W+w]

            Union(i,k)

ANS=0
for i in range(N):
    if find(i)==i:
        if Nodes[i]==1:
            pass
        else:
            ANS+=1


minus=0
BAD=[set() for i in range(H*W)]
for i in range(N):
    if Nodes[find(i)]>1:
        x,y=P[i]
        for dx,dy in DS:
            z,w=x+dx,y+dy

            if 0<=z<H and 0<=w<W and 0<=z*W+w<H*W:
                if MAP[z*W+w]!=-1:
                    continue
                BAD[z*W+w].add(find(i))
                minus=max(minus,len(BAD[z*W+w])-1)
        
plus=0

for i in range(N):
    if find(i)==i:
        if Nodes[i]==1:
            x,y=P[i]
            for dx,dy in DS:
                z,w=x+dx,y+dy
                if 0<=z<H and 0<=w<W and 0<=z*W+w<H*W:
                    if BAD[z*W+w]!=set():
                        pass
                    else:
                        plus=1


print(ANS-minus,ANS+plus)