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.

Examples

Input

2 2
2 0
0 0
-1 0
1 0


Output

2
1


Input

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


Output

3
1
2


Input

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


Output

5
4
3
2
1

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int m = in.nextInt();
        int[][] student =new int[n][2];
        int[][] checkPoint = new int[m][2];
        int[] indexArray = new int[n];
        for (int i = 0;i < n;i++){
        	student[i][0] = in.nextInt();
        	student[i][1] = in.nextInt();
        }
        for (int i=0;i<m;i++){
        	checkPoint[i][0] = in.nextInt();
        	checkPoint[i][1] = in.nextInt();	
        }
        for (int i=0;i<student.length;i++){
        	int min = 2147483647;
        	int index = -1;
        	for (int j=0;j<checkPoint.length;j++){
        		if(Math.abs(student[i][0]-checkPoint[j][0])+Math.abs(student[i][1]-checkPoint[j][1])<min){
        			min = Math.abs(student[i][0]-checkPoint[j][0])+Math.abs(student[i][1]-checkPoint[j][1]);
        			index = j+1;
        		}
        	}
        	//indexArray[i] = index;      	
        	System.out.println(index);
        }
	}
}
