import core.bitop;
import std.algorithm;
import std.ascii;
import std.bigint;
import std.conv;
import std.functional;
import std.math;
import std.numeric;
import std.range;
import std.stdio;
import std.string;
import std.random;
import std.typecons;

alias sread = () => readln.chomp();
alias Point2 = Tuple!(long, "y", long, "x");

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}

void minAssign(T, U = T)(ref T dst, U src)
{
    dst = cast(T) min(dst, src);
}

void maxAssign(T, U = T)(ref T dst, U src)
{
    dst = cast(T) max(dst, src);
}

enum MOD = (10 ^^ 9) + 7;

void main()
{
    long N, M;
    scan(N, M);
    auto ab = new Point2[](N);
    auto cd = new Point2[](M);

    foreach (i; 0 .. N)
    {
        long a, b;
        scan(a, b);
        ab[i] = Point2(a, b);
    }
    foreach (i; 0 .. M)
    {
        long a, b;
        scan(a, b);
        cd[i] = Point2(a, b);
    }
    // writeln(cd);
    foreach (i; 0 .. N)
    {
        long dist = long.max;
        long ans;
        foreach (j; 0 .. M)
        {
            long d = abs(ab[i].x - cd[j].x) + abs(ab[i].y - cd[j].y);
            if (d < dist)
            {
                dist = d;
                ans = j;
            }
        }
        writeln(ans + 1);
    }
}
