import io import sys from collections import defaultdict, deque, Counter from itertools import permutations, combinations, accumulate from heapq import heappush, heappop from bisect import bisect_right, bisect_left from math import gcd import math _INPUT = """\ 6 10 10 5 2 1 4 2 3 3 3 6 3 6 2 10 10 2 2 3 3 6 3 1 5 4 4 1 1 1 2 1 3 1 4 """ def input(): return sys.stdin.readline()[:-1] def solve(test): H,W,N,D=map(int,input().split()) field=[-1]*H*W G=[[] for _ in range(N)] for i in range(N): X,Y=map(lambda x:int(x)-1,input().split()) for x in range(X-D,X+D+1): for y in range(Y-(D-abs(x-X)),Y+(D-abs(x-X))+1): if 0<=xE[x]+1: E[y]=E[x]+1 C[y]=c dq.append(y) c+=1 c-=len([1 for g in G if g==[]]) ans1,ans2=10**9,0 for i in range(H): for j in range(W): s=set() s2=set() for x in range(i-D,i+D+1): for y in range(j-(D-abs(x-i)),j+(D-abs(x-i))+1): if 0<=x0]) ans1=min(ans1,tmp) ans2=max(ans2,tmp) print(ans1,ans2) def random_input(): from random import randint,shuffle N=randint(1,10) M=randint(1,N) A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)] shuffle(A) return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3 def simple_solve(): return [] def main(test): if test==0: solve(0) elif test==1: sys.stdin = io.StringIO(_INPUT) case_no=int(input()) for _ in range(case_no): solve(0) else: for i in range(1000): sys.stdin = io.StringIO(random_input()) x=solve(1) y=simple_solve() if x!=y: print(i,x,y) print(*[line for line in sys.stdin],sep='') break #0:提出用、1:与えられたテスト用、2:ストレステスト用 main(0)