import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = -1-(-1 << 31)
# inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

class UnionFind:
    def __init__(self, n):
        self._tree = [-1]*n
        # number of connected component
        self.cnt = n

    def root(self, u):
        stack = []
        while self._tree[u] >= 0:
            stack.append(u)
            u = self._tree[u]
        for v in stack: self._tree[v] = u
        return u

    def same(self, u, v):
        return self.root(u) == self.root(v)

    def merge(self, u, v):
        u, v = self.root(u), self.root(v)
        if u == v: return False
        if self._tree[u] > self._tree[v]: u, v = v, u
        self._tree[u] += self._tree[v]
        self._tree[v] = u
        self.cnt -= 1
        return True

    # size of connected component
    def size(self, u):
        return -self._tree[self.root(u)]

from collections import Counter

h,w,n,d=LI()
ij=LLI1(n)
ij2u={(i,j):u for u,(i,j) in enumerate(ij)}

uf=UnionFind(n)
can=set()
for u,(i,j) in enumerate(ij):
    for x in range(max(0,i-d),min(h,i+d+1)):
        e=d-abs(i-x)
        for y in range(max(0,j-e),min(w,j+e+1)):
            if (x,y) in ij2u:
                v=ij2u[x,y]
                uf.merge(u,v)
            else:
                can.add((x,y))

rr=set()
for u in range(n):
    r=uf.root(u)
    if uf.size(r)>1:
        rr.add(r)
s=len(rr)

mn,mx=inf,-inf
for i,j in can:
    ne=set()
    one=0
    for x in range(max(0,i-d),min(h,i+d+1)):
        e=d-abs(i-x)
        for y in range(max(0,j-e),min(w,j+e+1)):
            if (x,y) in ij2u:
                u=ij2u[x,y]
                u=uf.root(u)
                if uf.size(u)==1:
                    one=1
                else:
                    ne.add(u)
        if ne:
            cur=s-len(ne)+1
        elif one:
            cur=s+1
        else:
            cur=s
        mn=min(mn,cur)
        mx=max(mx,cur)

print(mn,mx)