#include "hpmq.h"
#include<bits/stdc++.h>

typedef long long i64;

Data D[200007];

void solve(
	const int n,
	const int m,
	const int *x,
	const int *y,
	const Data *d,
	const int *a,
	const int *b,
	const int *c,
	const Operation *o){
	for(int i=0;i<n;++i)D[i]=d[i],assert(!D[i].empty());
	for(int j=0;j<m;++j){
		assert(!o[j].empty());
		int A=a[j],B=b[j],C=c[j];
		Data ans;
		ans.clr();
		for(int i=0;i<n;++i){
			if(A*x[i]+B*y[i]<C){
				ans.add_eq(D[i]);
				o[j].apply(D[i]);
			}
		}
		ans.print();
	}
}