#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int o=5e5+10,B=700;
int n,m,X[o],Y[o],col[o],a[o],b[o],c[o],p[o],idinv[o],cnt[o],tot[o],e[o];long long d[o],ans[o];vector<int> vec[o];
struct Query{int a,b,c;};
struct Slope{
	int x,y;
	Slope(int x_,int y_):x(x_),y(y_){}
	inline int Quadrant()const{
		if((x==0&&y<0)||(x>0&&y<0)) return 0;
		if((x>0&&y==0)||(x>0&&y>0)) return 1;
		if((x==0&&y>0)||(x<0&&y>0)) return 2;
		return 3;
	}
	inline bool operator<(const Slope&b)const{
		if(Quadrant()^b.Quadrant()) return Quadrant()<b.Quadrant();
		return x*1ll*b.y-y*1ll*b.x>0;
	}
};
namespace foobar{
int n,A,B;bool typ;vector<int> id;vector<pair<Slope,pair<int,int> > > s;
inline int lowbit(int x){return x&-x;}
inline void modify(int pos,int val){for(++pos;pos<=n;pos+=lowbit(pos)) d[pos]+=val;}
inline long long query(int pos){long long res=0;for(++pos;pos;pos-=lowbit(pos)) res+=d[pos];return res;}
inline bool Cmp(int i,int j){return A*1ll*X[i]+B*1ll*Y[i]<A*1ll*X[j]+B*1ll*Y[j];}
inline void slv(){
	if(id.empty()) return;
	n=id.size();vector<pair<Slope,pair<int,int> > >().swap(s);
	A=0;B=-1;sort(id.begin(),id.end(),Cmp);
	for(int i=0;i<n;++i) for(int j=i+1,x,y;j<n;++j)
		x=X[id[j]]-X[id[i]],y=Y[id[j]]-Y[id[i]],
		s.push_back(make_pair(Slope(y,-x),make_pair(id[i],id[j]))),
		s.push_back(make_pair(Slope(-y,x),make_pair(id[j],id[i])));
	sort(s.begin(),s.end());
	for(int i=0;i<n;++i) idinv[id[i]]=i,d[i+1]=0;
	if(!typ) for(int i=0;i<n;++i) e[id[i]]=tot[col[id[i]]]++,modify(i,e[id[i]]);
	for(int i=1,j=0,sz=s.size(),l,r,md;i<=m;++i){
		A=a[p[i]];B=b[p[i]];
		for(int x,y;j<sz&&s[j].first<Slope(a[p[i]],b[p[i]]);++j){
			x=idinv[s[j].second.first];y=idinv[s[j].second.second];
			if(x>y) swap(x,y);
			if(Cmp(id[x],id[y])) continue;
			if(x+1==y){
				if(!typ){
					modify(x,-e[id[x]]);modify(y,-e[id[y]]);
					if(col[id[x]]==col[id[y]]) ++e[id[x]],--e[id[y]];
				}
				swap(id[x],id[y]);swap(idinv[id[x]],idinv[id[y]]);
				if(!typ) modify(x,e[id[x]]),modify(y,e[id[y]]);
				continue;
			}
			if(!typ){
				for(int k=x;k<=y;++k) modify(k,-e[id[k]]);
				for(int k=x;k<y;++k) for(int $=k+1;$<=y;++$) e[id[$]]-=(col[id[k]]==col[id[$]]);
			}
			sort(id.begin()+x,id.begin()+y+1,Cmp);
			for(int k=x;k<=y;++k) idinv[id[k]]=k;
			if(!typ){
				for(int k=x;k<y;++k) for(int $=k+1;$<=y;++$) e[id[$]]+=(col[id[k]]==col[id[$]]);
				for(int k=x;k<=y;++k) modify(k,e[id[k]]);
			}
		}
		for(l=-1,r=n-1;l<r;){
			md=(l+r+1)/2;
			if(a[p[i]]*1ll*X[id[md]]+b[p[i]]*1ll*Y[id[md]]+c[p[i]]<0) l=md;
			else r=md-1;
		}
		if(typ) cnt[p[i]]+=l+1;
		else ans[p[i]]+=query(l)*2+l+1;
	}
	vector<int>().swap(id);typ=0;
}
}
inline bool cmp(int A,int B){return Slope(a[A],b[A])<Slope(a[B],b[B]);}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i) scanf("%d%d%d",&X[i],&Y[i],&col[i]),vec[col[i]].push_back(i);
	for(int i=1;i<=m;++i) scanf("%d%d%d",&a[i],&b[i],&c[i]),p[i]=i;
	sort(p+1,p+m+1,cmp);
	for(int i=1;i<=n;++i) if((int)vec[i].size()>=B){
		for(int j=1;j<=m;++j) cnt[j]=0;
		for(int j=0,sz=vec[i].size();j<sz;++j){
			if(j%B==0) foobar::slv(),foobar::typ=1;
			foobar::id.push_back(vec[i][j]);
		}
		foobar::slv();
		for(int j=1;j<=m;++j) ans[j]+=cnt[j]*1ll*cnt[j];
	}
	for(int i=1;i<=n;++i) if(!vec[i].empty()&&(int)vec[i].size()<B){
		if((foobar::id.size()+vec[i].size())>B) foobar::slv();
		for(int j=0,sz=vec[i].size();j<sz;++j) foobar::id.push_back(vec[i][j]);
	}
	foobar::slv();
	for(int i=1;i<=m;++i) printf("%lld\n",ans[i]);
	return 0;
}