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.table = [-1]*n self.mem = [[u] for u in range(n)] self.cnt = n def root(self, u): stack = [] while self.table[u] >= 0: stack.append(u) u = self.table[u] for v in stack: self.table[v] = u return u def same(self, u, v): return self.root(u) == self.root(v) def merge(self, u, v): u = self.root(u) v = self.root(v) if u == v: return False su = -self.table[u] sv = -self.table[v] if su < sv: u, v = v, u self.table[u] = -su-sv self.table[v] = u self.mem[u] += self.mem[v] self.mem[v].clear() self.cnt -= 1 return True def member(self,u): return self.mem[self.root(u)] # グループの要素数 def size(self, u): return -self.table[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)) mn,mx=inf,-inf one=[] cnt=Counter() s=0 for uu in uf.mem: if not uu:continue if len(uu)==1: one.append(uu[0]) else: s+=1 xy = set() for u in uu: i,j=ij[u] 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)): xy.add(x*w+y) for v in xy:cnt[v]+=1 def inc(): for u in one: i, j = ij[u] 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*w+y not in cnt:return 1 return 0 mn=s if cnt:mn=s-max(cnt.values())+1 mx=s+inc() print(mn,mx)