h,w,n,d=map(int,input().split())
a=[[-1]*w for i in range(h)]
s=[]
r=list(range(n))

def union(x,y):
  rx=root(x)
  ry=root(y)
  if rx>ry:
    rx,ry=ry,rx
  r[ry]=rx
  return

def root(x):
  p=x
  l=[p]
  while r[p]!=p:
    p=r[p]
    l.append(p)
  for p in l:
    r[p]=l[-1]
  return r[x]

for i in range(n):
	x,y=map(int,input().split())
	x-=1
	y-=1
	a[x][y]=i
	s+=[(x,y)]
	for dx in range(-d,d+1):
		for dy in range(-d,d+1):
			xx=x+dx
			yy=y+dy
			if 0<=xx<h and 0<=yy<w and abs(dx)+abs(dy)<=d and a[xx][yy]!=-1:
				union(i,a[xx][yy])
for i in range(n):
	x,y=s[i]
	a[x][y]=root(i)
g0=len(set(r))
g1=g0
g2=g0
for x in range(h):
	for y in range(w):
		if a[x][y]==-1:
			rr=[]
			for dx in range(-d,d+1):
				for dy in range(-d,d+1):
					xx=x+dx
					yy=y+dy
					if 0<=xx<h and 0<=yy<w and abs(dx)+abs(dy)<=d and a[xx][yy]!=-1:
						rr+=[a[xx][yy]]
			rr=set(rr)
			if len(rr)==0:
				g1=g0+1
			else:
				g2=min(g2,g0-len(rr)+1)
print(g2,g1)