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 sc = new Scanner(System.in);
				int n = sc.nextInt();
				int m = sc.nextInt();
				int a[]=new int[n];
				int b[]=new int[n];
				int c[]=new int[m];
				int d[]=new int[m];
				int e[]=new int[m];
				int min[]=new int[n];
				int minIdx[]=new int[n];
				
				for(int i=0;i<n;i++){
					a[i]=sc.nextInt();
					b[i]=sc.nextInt();
				}
				for(int k=0;k<m;k++){
					c[k]=sc.nextInt();
					d[k]=sc.nextInt();
				}
				
				for(int i=0;i<n;i++){
					for(int k=0;k<m;k++){
						e[k]=Math.abs(a[i]-c[k])+Math.abs(b[i]-d[k]);
					}
					min[i]=e[0];
					for(int k=0;k<m;k++){
						if(min[i]>e[k]){
							min[i]=e[k];
							minIdx[i]=k;
						}
					}
				}
				for(int i=0;i<n;i++){
					System.out.println(minIdx[i]+1);
				}
		}		
	}