import sys from collections import deque def main(): input = sys.stdin.read().split() ptr = 0 N = int(input[ptr]); ptr +=1 M = int(input[ptr]); ptr +=1 K = int(input[ptr]); ptr +=1 T = int(input[ptr]); ptr +=1 # Read mysterious squares mysterious = [] for _ in range(K): A = int(input[ptr])-1; ptr +=1 # convert to 0-based B = int(input[ptr])-1; ptr +=1 C = int(input[ptr]); ptr +=1 D = int(input[ptr]); ptr +=1 mysterious.append( (A, B, C, D) ) # Compute dist_start: minimal steps from (0,0) dist_start = [ [ -1 for _ in range(M) ] for __ in range(N) ] q = deque() q.append( (0,0) ) dist_start[0][0] = 0 while q: i,j = q.popleft() for di, dj in [ (-1,0), (1,0), (0,-1), (0,1) ]: ni, nj = i+di, j+dj if 0<=ni