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;
using System.Text;
class Program
{
    static void Main(string[] args)
    {
            // 入力
            string[] sS = Console.ReadLine().Trim().Split(' ');
            int iN = int.Parse(sS[0]);
            int iM = int.Parse(sS[1]);
            List<ClsSmp> lstMem = new List<ClsSmp>();           // 人
            List<ClsSmp> lstChk = new List<ClsSmp>();           // CK
            for (int i = 0; i < iN; i++) { sS = Console.ReadLine().Trim().Split(' '); lstMem.Add(new ClsSmp() { iX = int.Parse(sS[0]), iY = int.Parse(sS[1]) }); }
            for (int i = 0; i < iM; i++) { sS = Console.ReadLine().Trim().Split(' '); lstChk.Add(new ClsSmp() { iX = int.Parse(sS[0]), iY = int.Parse(sS[1]) }); }

            System.Diagnostics.Stopwatch sw = new System.Diagnostics.Stopwatch();
            sw.Start();

            // 解析
            for (int i = 0; i < lstMem.Count; i++)
            {
                List<ClsDif> lstDif = new List<ClsDif>();           // 距離
                for (int j = 0; j < lstChk.Count; j++)
                {
                    int iDid = Math.Abs(lstMem[i].iX - lstChk[j].iX) + Math.Abs(lstMem[i].iY - lstChk[j].iY);
                    lstDif.Add(new ClsDif() { iC = j , iD = iDid });
                }
                if (lstDif.Count > 1) { lstDif.Sort(delegate (ClsDif mca1, ClsDif mca2) { return (int)(mca1.iD - mca2.iD) == 0 ? (mca1.iC - mca2.iC) : (mca1.iD - mca2.iD); }); }     // iDの昇順 の iCの昇順
                lstMem[i].iC = lstDif[0].iC + 1;
            }

            //出力
            for (int i = 0; i < lstMem.Count; i++)
            {
                Console.WriteLine("{0}", lstMem[i].iC.ToString().Trim());
            }

            sw.Stop();
#if DEBUG
            Console.WriteLine();
            Console.WriteLine("{0}", sw.Elapsed.ToString());
            Console.WriteLine("続行するには何かキーを押してください．．．");
            Console.ReadKey();
#endif
    }
        private class ClsSmp
        {
            public int iX { get; set; } = 0;
            public int iY { get; set; } = 0;
            public int iC { get; set; } = 0;            // 最短CK No.
        }

        private class ClsDif
        {
            public int iC { get; set; } = 0;            // CK No.
            public int iD { get; set; } = 0;            // 距離
        }
}