#include <bits/stdc++.h>
//#include <math.h>
using namespace std;

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846

typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> PP;

struct edge {
	int to, cost;
	edge(int t,int c):to(t),cost(c) {}
};


//-----------------------------------------------------------------------------

int n,m;
int a[50],b[50],c[50],d[50];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin>>n>>m;
	REP(i,n) cin>>a[i]>>b[i];
	REP(i,m) cin>>c[i]>>d[i];

	REP(i,n) {
		int pos,d=INF;
		REP(j,m) {
			if(abs(a[i]-c[j])+abs(b[i]-d[j])<d) pos=j+1,d=abs(a[i]-c[j])+abs(b[i]-d[j]);
		}
		cout<<pos<<endl;
	}

	return 0;
}
