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.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static boolean hiekou = false;
	public static int intHiekou = 0;

	public static void main(String[] args) {
		// 標準入力
		Scanner sc = new Scanner(System.in);

		String line1 = sc.nextLine();
		List<String> lines1 = Arrays.asList(line1.split(" "));
		Integer N = Integer.parseInt(lines1.get(0));
		Integer M = Integer.parseInt(lines1.get(1));

		List<String> Ns = new ArrayList<String>();
		List<String> Ms = new ArrayList<String>();
		List<Integer> resList = new ArrayList<Integer>();

		for(int i = 0;i <N; i++) {
			Ns.add(sc.nextLine());
		}
		for(int j = 0;j < M; j++) {
			Ms.add(sc.nextLine());
		}

		List<String> ab = null;
		int a = 0;
		int b = 0;
		List<String> cd = null;
		int c = 0;
		int d = 0;
		int man = 0;
		int res = 0;
		int newman = 0;

		for(int j = 0;j < Ns.size(); j++) {
			ab = Arrays.asList(Ns.get(j).split(" "));
			a = Integer.parseInt(ab.get(0));
			b = Integer.parseInt(ab.get(1));
			man = 999999999;
			for(int k = 0;k < Ms.size(); k++) {
				cd = Arrays.asList(Ms.get(k).split(" "));
				c = Integer.parseInt(cd.get(0));
				d = Integer.parseInt(cd.get(1));
				newman = Math.abs(a - c) +  Math.abs(b - d);
				if(newman < man) {
					res = k+1;
					man = newman;
				}
			}
			resList.add(res);
		}

		for(int z = 0;z < resList.size(); z++) {
			System.out.println(resList.get(z));
		}

	}

}