#include <bits/stdc++.h>
using namespace std;
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long INF = 1LL << 60;
const long long MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s) {
  return f.second > s.second;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long nCr(long long n, long long r) {
  if (r == 0 || r == n) {
    return 1;
  } else if (r == 1) {
    return n;
  }
  return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
long long nPr(long long n, long long r) {
  r = n - r;
  long long ret = 1;
  for (long long i = n; i >= r + 1; i--) ret *= i;
  return ret;
}
bool comp(const string& f, const string& s) { return f.size() < s.size(); }
int main(void) {
  int n, m;
  cin >> n >> m;
  vector<pair<int, int>> s(n), c(n);
  for (int i = 0; i < n; i++) {
    cin >> s[i].first >> s[i].second;
  }
  for (int i = 0; i < m; i++) {
    cin >> c[i].first >> c[i].second;
  }
  for (int i = 0; i < n; i++) {
    long long shortest = INF;
    int ans = 0;
    for (int j = 0; j < m; j++) {
      long long tmp =
          abs(s[i].first - c[j].first) + abs(s[i].second - c[j].second);
      if (shortest > tmp) {
        shortest = tmp;
        ans = j;
      }
    }
    cout << ans + 1 << endl;
  }
}
