from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]
def inside(y, x, H, W):
return 0 <= y < H and 0 <= x < W
def ceil(a, b):
return (a + b - 1) // b
def main():
N, M = map(int, input().split())
s = []
for _ in range(N):
a, b = map(int, input().split())
s.append((a, b))
p = []
for _ in range(M):
c, d = map(int, input().split())
p.append((c, d))
for a, b in s:
ans = 0
min_dist = INF
for i, (c, d) in enumerate(p):
dist = abs(a - c) + abs(b - d)
if dist < min_dist:
ans = i + 1
min_dist = dist
print(ans)
if __name__ == '__main__':
main()