//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
mt19937_64 rnd(20210448);
ll x[100100],y[100100];
ll A[200200],B[200200],C[200200];
double angle[200200];
int n,m;
vector<int> vec[200200];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++)
		cin>>x[i]>>y[i];
	for(int i=1;i<=m;i++)
		cin>>A[i]>>B[i]>>C[i];
	vector<int> key;
	int s=sqrt(n);
	for(int i=1;i<=s+10;i++)
		key.pb(rnd()%n+1);
	srt(key);
	uni(key);
	for(int i=1;i<=m;i++)
	{
		ll mn=1ll*inf*inf;
		int ind=-1;
		for(auto u:key)
		{
			ll dist=x[u]*A[i]+y[u]*B[i]+C[i];
			dist=abs(dist);
			if(dist<mn)
			{
				mn=dist;
				ind=u;
			}
		}
		vec[ind].pb(i);
	}
	for(int i=1;i<=n;i++)
	{
		sort(ALL(vec[i]),[&](const int &a,const int &b){return angle[a]<angle[b];});
		for(auto x:vec[i])
			cout<<x<<'\n';
	}
	return 0;
}