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.*;
 
// ABC 6-C
// http://abc006.contest.atcoder.jp/tasks/abc006_3
 
public class Main {
	
	public static void main (String[] args) throws java.lang.Exception {
	    Scanner in = new Scanner(System.in);

	    int n = in.nextInt();
	    int m = in.nextInt();
	    
	    int[][] students = new int[n][2];
	    int[][] checks = new int[m][2];
	    
	    for (int i = 0; i < n; i++) {
	    	students[i][0] = in.nextInt();
	    	students[i][1] = in.nextInt();
	    }
	    for (int i = 0; i < m; i++) {
	    	checks[i][0] = in.nextInt();
	    	checks[i][1] = in.nextInt();
	    }
	    
	    for (int i = 0; i < n; i++) {
	    	int check = -1;
	    	int d = Integer.MAX_VALUE;
	    	
	    	for (int j = 0; j < m; j++) {
	    		int tempd = Math.abs(students[i][0] - checks[j][0]) + Math.abs(students[i][1] - checks[j][1]);
	    		if (tempd < d) {
	    			check = j;
	    			d = tempd;
	    		}
	    	}
	    	System.out.println(check + 1);
	    }
	}
}
