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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;

namespace atcode {
    class MainClass {
        class Point {
            public int x;
            public int y;
            public Point() {
                x = 0;
                y = 0;
            }
            public double getDistTo(Point p) {
                return (Math.Abs(x - p.x) + Math.Abs(y - p.y));
            }
        };
		static void Main(string[] args) {
            string[] firstLine = Console.ReadLine().Split(' ');
            int studentNum = int.Parse(firstLine[0]);
            int checkPointNum = int.Parse(firstLine[1]);

            if (studentNum < 1 || checkPointNum < 1) return;
            if (studentNum > 50 || checkPointNum > 50) return;

            List<Point> studentPoints = new List<Point>();
            List<Point> checkPoints = new List<Point>();
            for (int i = 0; i < studentNum; i++) {
                string[] line = Console.ReadLine().Split(' ');
                Point p = new Point();
                p.x = int.Parse(line[0]);
                p.y = int.Parse(line[1]);
                studentPoints.Add(p);
            }
	   for (int i = 0; i < checkPointNum; i++) {
                string[] line = Console.ReadLine().Split(' ');
		Point p = new Point();
                p.x = int.Parse(line[0]);
                p.y = int.Parse(line[1]);
                checkPoints.Add(p);
            }

            foreach (Point p in studentPoints) {
                double minDist = double.MaxValue;
                int minDistIndex = 1;
                int index = 1;
                foreach (Point p2 in checkPoints) {
                    double dist = p.getDistTo(p2);
                    if (dist < minDist) {
                        minDist = dist;
                        minDistIndex = index;
                    }
                    index++;
                }
		Console.WriteLine(minDistIndex.ToString());
            }
	}
    }
}