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;
using System.Linq;

class Program
{
    static string InputPattern = "InputX";

    static List<string> GetInputList()
    {
        var WillReturn = new List<string>();

        if (InputPattern == "Input1") {
            WillReturn.Add("2 2");
            WillReturn.Add("2 0");
            WillReturn.Add("0 0");
            WillReturn.Add("-1 0");
            WillReturn.Add("1 0");
            //2
            //1
        }
        else if (InputPattern == "Input2") {
            WillReturn.Add("3 4");
            WillReturn.Add("10 10");
            WillReturn.Add("-10 -10");
            WillReturn.Add("3 3");
            WillReturn.Add("1 2");
            WillReturn.Add("2 3");
            WillReturn.Add("3 5");
            WillReturn.Add("3 5");
            //3
            //1
            //2
        }
        else if (InputPattern == "Input3") {
            WillReturn.Add("5 5");
            WillReturn.Add("-100000000 -100000000");
            WillReturn.Add("-100000000 100000000");
            WillReturn.Add("100000000 -100000000");
            WillReturn.Add("100000000 100000000");
            WillReturn.Add("0 0");
            WillReturn.Add("0 0");
            WillReturn.Add("100000000 100000000");
            WillReturn.Add("100000000 -100000000");
            WillReturn.Add("-100000000 100000000");
            WillReturn.Add("-100000000 -100000000");
            //5
            //4
            //3
            //2
            //1
        }
        else {
            string wkStr;
            while ((wkStr = Console.ReadLine()) != null) WillReturn.Add(wkStr);
        }
        return WillReturn;
    }

    struct PointDef
    {
        internal int X;
        internal int Y;
    }

    static void Main()
    {
        List<string> InputList = GetInputList();

        int[] wkArr = { };
        Action<string> SplitAct = pStr =>
            wkArr = pStr.Split(' ').Select(X => int.Parse(X)).ToArray();

        SplitAct(InputList[0]);
        int N = wkArr[0];
        int M = wkArr[1];

        var GakuseiList = new List<PointDef>();
        for (int I = 1; I <= N; I++) {
            SplitAct(InputList[I]);
            GakuseiList.Add(new PointDef() { X = wkArr[0], Y = wkArr[1] });
        }
        var CheckPointList = new List<PointDef>();
        for (int I = 1; I <= M; I++) {
            SplitAct(InputList[N + I]);
            CheckPointList.Add(new PointDef() { X = wkArr[0], Y = wkArr[1] });
        }

        foreach (PointDef EachGakusei in GakuseiList) {
            int MinPosInd = -1;
            int MinKyori = int.MaxValue;
            for (int I = 0; I <= CheckPointList.Count - 1; I++) {
                int CurrKyori = 0;
                CurrKyori += Math.Abs(CheckPointList[I].X - EachGakusei.X);
                CurrKyori += Math.Abs(CheckPointList[I].Y - EachGakusei.Y);

                if (CurrKyori < MinKyori) {
                    MinKyori = CurrKyori;
                    MinPosInd = I;
                }
            }
            Console.WriteLine(MinPosInd + 1);
        }
    }
}