#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,m;

#define i128 __int128
inline i128 ABS(i128 x){return x<0?-x:x;}
struct frac{
	i128 x,y;
	frac(){}
	frac(i128 xx,i128 yy=1ll):x(xx),y(yy){
		if(y<0)x=-x,y=-y;
	}
	friend frac operator +(frac a,frac b){return frac(a.x*b.y+a.y*b.x,a.y*b.y);}
	friend frac operator -(frac a,frac b){return frac(a.x*b.y-a.y*b.x,a.y*b.y);}
	friend frac operator *(frac a,frac b){return frac(a.x*b.x,a.y*b.y);}
	friend frac operator /(frac a,frac b){return a*frac(b.y,b.x);}
	friend bool operator <(frac a,frac b){return a.x*b.y<b.x*a.y;}
	friend bool operator >(frac a,frac b){return a.x*b.y>b.x*a.y;}
	friend bool operator <=(frac a,frac b){return !(a>b);}
	friend bool operator >=(frac a,frac b){return !(a<b);}
	friend bool operator ==(frac a,frac b){return a.x*b.y==b.x*a.y;}
	friend bool operator !=(frac a,frac b){return !(a==b);}
	frac operator - () {return frac(0)-x;}
};

struct P{
	int x,y;
	P(int x=0,int y=0):x(x),y(y){}
	P&operator +=(P o){return x+=o.x,y+=o.y,*this;}
	P&operator -=(P o){return x-=o.x,y-=o.y,*this;}
	P&operator *=(int o){return x*=o,y*=o,*this;}
	P&operator /=(int o){return x/=o,y/=o,*this;}
	friend P operator +(P a,P b){return a+=b;}
	friend P operator -(P a,P b){return a-=b;}
	friend P operator *(P a,int b){return a*=b;}
	friend P operator /(P a,int b){return a/=b;}
	friend bool operator <(P a,P b){return a.x==b.x?a.y<b.y:a.x<b.x;}
	friend int operator *(P a,P b){return a.x*b.x+a.y*b.y;} // dot
	friend int operator %(P a,P b){return a.x*b.y-a.y*b.x;} // cross
};

struct point{
	int x,y,c;
	bool operator <(const point&b)const{return x<b.x||(x==b.x&&y<b.y);}
}p[maxn],a[maxn];

struct node{
	int x,y; frac k;
	node(int xx=0,int yy=0,frac kk=frac(0)){x=xx,y=yy,k=kk;}
	friend bool operator <(node a,node b){
		if(a.k!=b.k)return a.k<b.k;
		if(a.x!=b.x)return a.x<b.x;
		return a.y<b.y;
	}
}t[1000005];

struct line{
	frac k; int a,b,c,id;
	friend bool operator <(line a,line b){return a.k<b.k;}
	int F(int x,int y){return a*x+b*y+c;}
}q[500005];
int res[500005],resc[500005];

int B=1000;
int cnt,tot,pos[maxn],rev[maxn];

int l1[maxn],r1[maxn],c1[maxn],s1[maxn];
int l2[maxn],r2[maxn],c2[maxn],s2[maxn];
int lc,rc,prc;

int S(int x){return x*x;}

void upd1(int u){
	s1[u]=s1[u-1]+S(c1[u])-S(c1[u]-1);
	l1[u]=l1[u-1],r1[u]=r1[u-1];
	if(a[u].c==lc) l1[u]=c1[u];
	if(a[u].c==rc) r1[u]=c1[u];
}
void upd2(int v){
	s2[v]=s2[v+1]+S(c2[v])-S(c2[v]-1);
	l2[v]=l2[v+1],r2[v]=r2[v+1];
	if(a[v].c==lc) l2[v]=c2[v];
	if(a[v].c==rc) r2[v]=c2[v];
}

void upd(int x,int y){
//	cout<<"upd "<<pos[x]<<" "<<pos[y]<<endl;
	int u=pos[x],v=pos[y];
	assert(abs(u-v)==1); 
	if(a[u].c!=a[v].c) swap(c1[u],c1[v]),swap(c2[u],c2[v]);
	swap(a[u],a[v]);
	upd1(u);
	upd2(v);
	swap(pos[x],pos[y]);
}
void work(int x,int y){
	if(pos[x]>pos[y])return;
	Rep(j,pos[y],pos[x]+1){
		upd(rev[j-1],rev[j]);
		swap(rev[j-1],rev[j]);
	}
}

int col[maxn];
void init()
{
	For(i,1,cnt) col[a[i].c]=0;
	c1[0]=c2[0]=s1[0]=s2[0]=l1[0]=l2[0]=r1[0]=r2[0]=0;
	int X=cnt+1;
	c1[X]=c2[X]=s1[X]=s2[X]=l1[X]=l2[X]=r1[X]=r2[X]=0;
	For(i,1,cnt){
		++col[a[i].c];
		c1[i]=col[a[i].c];
		s1[i]=s1[i-1]+S(c1[i])-S(c1[i]-1);
		l1[i]=l1[i-1],r1[i]=r1[i-1];
		if(a[i].c==lc)l1[i]=c1[i];
		if(a[i].c==rc)r1[i]=c1[i];
	}
	For(i,1,cnt) col[a[i].c]=0;
	Rep(i,cnt,1){
		++col[a[i].c];
		c2[i]=col[a[i].c];
		s2[i]=s2[i+1]+S(c2[i])-S(c2[i]-1);
		l2[i]=l2[i+1],r2[i]=r2[i+1];
		if(a[i].c==lc)l2[i]=c2[i];
		if(a[i].c==rc)r2[i]=c2[i];
	}
}

void solve(int bl,int br)
{
	cnt=tot=0;
	lc=p[bl].c,rc=p[br].c;
	For(i,bl,br) a[++cnt]=p[i];
	For(i,1,cnt) pos[i]=rev[i]=i;
	sort(a+1,a+cnt+1);
	For(i,1,cnt)
		For(j,i+1,cnt)
			if(a[i].x!=a[j].x)
				t[++tot]=node(i,j,frac(a[j].y-a[i].y,a[j].x-a[i].x));
	sort(t+1,t+tot+1);
	init();
	int j=1;
	For(i,1,m){
		while(j<=tot && t[j].k<q[i].k){
			int x=t[j].x,y=t[j].y;
			work(x,y);
			++j;
		}
		int sum,sl,sr;
		int l=1,r=cnt,id=q[i].id;
		if(q[i].b>0){
			int x=0;
			while(l<=r){
				int mid=l+r>>1;
				if(q[i].F(a[mid].x,a[mid].y)<0)x=mid,l=mid+1;
				else r=mid-1;
			}
			sum=s1[x],sl=l1[x],sr=r1[x];
		}else{
			int x=cnt+1;
			while(l<=r){
				int mid=l+r>>1;
				if(q[i].F(a[mid].x,a[mid].y)<0)x=mid,r=mid-1;
				else l=mid+1;
			}
			sum=s2[x],sl=l2[x],sr=r2[x];
		}
		if(prc!=lc) res[id]+=sum,resc[id]=sr;
		else{
			res[id]+=sum+S(resc[id]+sl)-S(sl)-S(resc[id]);
			if(lc==rc)resc[id]+=sl;
			else resc[id]=sr; 
		}
	}
	prc=rc;
}

signed main()
{
	n=read(),m=read();
	For(i,1,n)p[i].x=read(),p[i].y=read(),p[i].c=read();
	sort(p+1,p+n+1,[&](point a,point b){return a.c<b.c||(a.c==b.c&&a<b);});
	For(i,1,m){
		int a=read(),b=read(),c=read();
		q[i].k=frac(-a,b),q[i].id=i; 
		q[i].a=a,q[i].b=b,q[i].c=c;
	}
	sort(q+1,q+m+1);
	for(int l=1;l<=n;l+=B) solve(l,min(n,l+B-1));
	For(i,1,m)printf("%lld\n",res[i]);
	return 0;
}