output_description: Print N lines.  
  The i-th line (1 \leq i \leq N) should contain the index of the checkpoint for
  the i-th student to go.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N M
      a_1 b_1
      :  
      a_N b_N
      c_1 d_1
      :  
      c_M d_M
attempt: N, M = map(int, input().strip().split(" "))
  persons = [list(map(int, input().strip().split(" "))) for _ in range(N)]
  checkpoints = [list(map(int, input().strip().split(" "))) for _ in range(M)]
  
  
  def distance(person, checkpoint):
      return sum(abs(a - b) for a, b in zip(person, checkpoint))
  
  
  for person in persons:
      print(
          sorted(
              [
                  [distance(person, checkpoint), i + 1]
                  for i, checkpoint in enumerate(checkpoints)
              ]
          )[0][1]
      )
  
problem_description: Statement
  
  There are N students and M checkpoints on the xy-plane.  
  The coordinates of the i-th student (1 \leq i \leq N) is (a_i,b_i), and the
  coordinates of the checkpoint numbered j (1 \leq j \leq M) is (c_j,d_j).  
  When the teacher gives a signal, each student has to go to the nearest
  checkpoint measured in _Manhattan distance_.  
  The Manhattan distance between two points (x_1,y_1) and (x_2,y_2) is
  |x_1-x_2|+|y_1-y_2|.  
  Here, |x| denotes the absolute value of x.  
  If there are multiple nearest checkpoints for a student, he/she will select
  the checkpoint with the smallest index.  
  Which checkpoint will each student go to?
samples: [{"input": "2 2\n    2 0\n    0 0\n    -1 0\n    1 0", "output": "2\n    1\n    \n\nThe Manhattan distance between the first student and each checkpoint is:\n\n  * For checkpoint 1: |2-(-1)|+|0-0|=3\n  * For checkpoint 2: |2-1|+|0-0|=1\n\nThe nearest checkpoint is checkpoint 2. Thus, the first line in the output\nshould contain 2.\n\nThe Manhattan distance between the second student and each checkpoint is:\n\n  * For checkpoint 1: |0-(-1)|+|0-0|=1\n  * For checkpoint 2: |0-1|+|0-0|=1\n\nWhen there are multiple nearest checkpoints, the student will go to the\ncheckpoint with the smallest index. Thus, the second line in the output should\ncontain 1.\n\n* * *"}, {"input": "3 4\n    10 10\n    -10 -10\n    3 3\n    1 2\n    2 3\n    3 5\n    3 5", "output": "3\n    1\n    2\n    \n\nThere can be multiple checkpoints at the same coordinates.\n\n* * *"}, {"input": "5 5\n    -100000000 -100000000\n    -100000000 100000000\n    100000000 -100000000\n    100000000 100000000\n    0 0\n    0 0\n    100000000 100000000\n    100000000 -100000000\n    -100000000 100000000\n    -100000000 -100000000", "output": "5\n    4\n    3\n    2\n    1"}]