Problem:
Score : 200 points

Problem 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?

Constraints

1 \leq N,M \leq 50

-10^8 \leq a_i,b_i,c_j,d_j \leq 10^8

All input values are integers.

Input

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

Output

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.

Sample Input 1

2 2
2 0
0 0
-1 0
1 0

Sample Output 1

2
1

The Manhattan distance between the first student and each checkpoint is:

For checkpoint 1: |2-(-1)|+|0-0|=3

For checkpoint 2: |2-1|+|0-0|=1

The nearest checkpoint is checkpoint 2. Thus, the first line in the output should contain 2.

The Manhattan distance between the second student and each checkpoint is:

For checkpoint 1: |0-(-1)|+|0-0|=1

For checkpoint 2: |0-1|+|0-0|=1

When there are multiple nearest checkpoints, the student will go to the checkpoint with the smallest index. Thus, the second line in the output should contain 1.

Sample Input 2

3 4
10 10
-10 -10
3 3
1 2
2 3
3 5
3 5

Sample Output 2

3
1
2

There can be multiple checkpoints at the same coordinates.

Sample Input 3

5 5
-100000000 -100000000
-100000000 100000000
100000000 -100000000
100000000 100000000
0 0
0 0
100000000 100000000
100000000 -100000000
-100000000 100000000
-100000000 -100000000

Sample Output 3

5
4
3
2
1

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;

class Main {
    public static void main(final String[] args) throws Exception {

        try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in));) {
            List<String> firstRow = Arrays.asList(br.readLine().split(" "));
            int studentCount = Integer.parseInt(firstRow.get(0));
            int checkPointCount = Integer.parseInt(firstRow.get(1));

            List<Integer> studentPointList = new ArrayList<>();
            for (int i = 0; i < studentCount; i++) {
                List<String> tmpInput = Arrays.asList(br.readLine().split(" "));
                studentPointList.add(Integer.parseInt(tmpInput.get(0)));
                studentPointList.add(Integer.parseInt(tmpInput.get(1)));
            }

            List<Integer> checkPointList = new ArrayList<>();
            for (int i = 0; i < checkPointCount; i++) {
                List<String> tmpInput = Arrays.asList(br.readLine().split(" "));
                checkPointList.add(Integer.parseInt(tmpInput.get(0)));
                checkPointList.add(Integer.parseInt(tmpInput.get(1)));
            }

            List<List<Integer>> distanceList = new ArrayList<>();
            for (int i = 0; i < studentPointList.size() - 1; i += 2) {
                List<Integer> distanceListTmp = new ArrayList<>();
                for (int j = 0; j < checkPointList.size() - 1; j += 2) {
                    distanceListTmp.add(Math.abs(studentPointList.get(i) - checkPointList.get(j)) + Math.abs(studentPointList.get(i + 1) - checkPointList.get(j + 1)));
                }
                distanceList.add(distanceListTmp);
            }

            List<Integer> ansList = new ArrayList<>();
            for (List<Integer> distances : distanceList) {
                int min = distances.get(0);
                int ansTmp = 1;
                for (int i = 0; i < distances.size(); i++) {
                    if (distances.get(i) < min) {
                        min = distances.get(i);
                        ansTmp = i + 1;
                    }
                }
                ansList.add(ansTmp);
            }

            for (int ans : ansList) {
                System.out.println(ans);
            }
        } catch (IOException | NumberFormatException e) {
            e.printStackTrace();
            System.exit(0);
        } catch (final Exception e) {
            e.printStackTrace();
            System.exit(0);
        }
    }
}