#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N = 1e5;
const int M = 2e5;
const int B = 250;

int n, m;
int x[N + 5], y[N + 5];
int a[M + 5], b[M + 5], c[M + 5];
double dist(int i, int j) { return fabs((ll)a[j] * x[i] + (ll)b[j] * y[i] + c[j]) / sqrt((ll)a[j] * a[j] + (ll)b[j] * b[j]); }

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

bool vis[N + 5];
vector<int> key;
vector<pair<double, int>> line[N + 5];

int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= n; ++i) scanf("%d%d", x + i, y + i);
  for (int i = 1; i <= m; ++i) scanf("%d%d%d", a + i, b + i, c + i);
  for (int i = 1; i <= min(B, n); ++i) {
    int j;
    do j = uniform_int_distribution<int>(1, n)(rng); while (vis[j]);
    vis[j] = 1, key.push_back(j);
  }
  for (int i = 1; i <= m; ++i) {
    int res = 0;
    for (int j : key)
      if (!res || dist(j, i) < dist(res, i)) res = j;
    line[res].emplace_back(atan2(-a[i], b[i]), i);
  }
  for (int i : key) {
    sort(line[i].begin(), line[i].end());
    for (auto [_, j] : line[i]) printf("%d\n", j);
  }
}
/*#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N = 1e5;
const int M = 2e5;
const int B = 250;

int n, m;
int x[N + 5], y[N + 5];
int a[M + 5], b[M + 5], c[M + 5];
double dist(int i, int j) { return fabs((ll)a[j] * x[i] + (ll)b[j] * y[i] + c[j]) / sqrt((ll)a[j] * a[j] + (ll)b[j] * b[j]); }

  for (int i : key) {
    sort(line[i].begin(), line[i].end());
    for (auto [_, j] : line[i]) printf("%d\n", j);
  }
}*/