#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dou;
typedef pair<int,int> pii;
#define fi first
#define se second
#define mapa make_pair
typedef long double ld;
typedef unsigned long long ull;
struct IO{
    static const int S=1<<21;
    char buf[S],*p1,*p2;int st[105],Top;
    ~IO(){clear();}
    inline void clear(){fwrite(buf,1,Top,stdout);Top=0;}
    inline void pc(const char c){Top==S&&(clear(),0);buf[Top++]=c;}
    inline char gc(){return p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++;}
    inline IO&operator >> (char&x){while(x=gc(),x==' '||x=='\n'||x=='\r');return *this;}
    template<typename T>inline IO&operator >> (T&x){
        x=0;bool f=0;char ch=gc();
       while(!isdigit(ch)){if(ch=='-') f^=1;ch=gc();}
        while(isdigit(ch)) x=(x<<3)+(x<<1)+ch-'0',ch=gc();
        f?x=-x:0;return *this;
    }
    inline IO&operator << (const char c){pc(c);return *this;}
    template<typename T>inline IO&operator << (T x){
        if(x<0) pc('-'),x=-x;
        do{st[++st[0]]=x%10,x/=10;}while(x);
        while(st[0]) pc('0'+st[st[0]--]);return *this;
    }
}fin,fout;
const int N=50005, M=500005;
inline bool chk(int x1, int y1, int x2, int y2){
    bool op=1;
    if(x1<0) op^=1;
    if(x2<0) op^=1;
    if(op) return (ll)y1*x2<(ll)y2*x1;
    else return (ll)y1*x2>(ll)y2*x1;
}
inline bool chk2(int x1, int y1, int x2, int y2){
    bool op=1;
    if(x1<0) op^=1;
    if(x2<0) op^=1;
    if(op) return (ll)y1*x2<=(ll)y2*x1;
    else return (ll)y1*x2>=(ll)y2*x1;
}
int n, m, B;
vector<pii> vec[N];
struct node{
	int a, b, c, id;
	inline bool operator <(const node &x)const{
        return chk(b, -a, x.b, -x.a);
	}
}v[M];
int ans[M]; ll out[M];
vector<pii> bin;
struct node2{
	int a, b, x, y;
	inline bool operator <(const node2 &z)const{
        if((ll)a*z.b==(ll)z.a*b){
            if(x==z.x) return y<z.y;
            return x<z.x;
        }
        return chk(a, b, z.a, z.b);
	}
};
int pos[N], rev[N];
inline void work(int x, int y){
	if(pos[x]>pos[y]) return ;
	swap(rev[pos[x]], rev[pos[y]]);
	swap(pos[x], pos[y]);
}
int tot;
inline void solve(){
	sort(bin.begin(), bin.end());
	tot=bin.size();
	vector<node2> swp;
	for(int i=0; i<tot; ++i){
		pos[i]=i; rev[i]=i;
		for(int j=i+1; j<tot; ++j){
			if(bin[i].fi==bin[j].fi) continue;
			swp.emplace_back((node2){bin[j].fi-bin[i].fi, bin[j].se-bin[i].se, i, j});
		}
	}
	sort(swp.begin(), swp.end());
	int p=0;
	for(int i=1; i<=m; ++i){
		while(p<(int)swp.size()&&chk2(swp[p].a, swp[p].b, v[i].b, -v[i].a)) work(swp[p].x, swp[p].y), ++p;
        if(v[i].b>=0){
            int l=0, r=tot-1, res=-1;
            while(l<=r){
                int mid=(l+r)>>1;
                if((ll)bin[rev[mid]].fi*v[i].a+(ll)bin[rev[mid]].se*v[i].b+(ll)v[i].c<0ll) {res=mid, l=mid+1;}
                else r=mid-1;
            }
            ans[v[i].id]+=res+1;
        }
        else{
            int l=0, r=tot-1, res=tot;
            while(l<=r){
                int mid=(l+r)>>1;
                if((ll)bin[rev[mid]].fi*v[i].a+(ll)bin[rev[mid]].se*v[i].b+(ll)v[i].c<0ll) {res=mid, r=mid-1;}
                else l=mid+1;
            }
            ans[v[i].id]+=tot-res;
        }
	}
}
struct node3{
	int a, b, c;
	inline bool operator <(const node3 &x)const{
		if(a^x.a) return a<x.a;
		return b<x.b;
	}
};
vector<node3> bin2;
set<int> st[N];
int rk[N], rkk[N];
ll tr[N], trr[N];
inline void mdf(int x, int v){
    ++x;
    for(; x<=tot; x+=(x&-x)) tr[x]+=v;
}
inline ll get(int x){
    ++x; ll ret=0;
    for(; x; x-=(x&-x)) ret+=tr[x];
    return ret;
}
inline void mdff(int x, int v){
    ++x;
    for(; x; x-=(x&-x)) trr[x]+=v;
}
inline ll gett(int x){
    ++x; ll ret=0;
    for(; x<=tot; x+=(x&-x)) ret+=trr[x];
    return ret;
}
typedef set<int>::iterator IT;
inline void work2(int x, int y){
	if(pos[x]>pos[y]) return ;
	if(bin2[x].c==bin2[y].c) {
		swap(rev[pos[x]], rev[pos[y]]);
		swap(pos[x], pos[y]);
		return ;
	}
	IT it=st[bin2[x].c].lower_bound(pos[x]); 
	int nrk=rk[*it], nrkk=rkk[*it];
    int lstrk=rk[*it], lstrkk=rkk[*it];
	++it;
	while(it!=st[bin2[x].c].end()&&(*it)<pos[y]){
		--rk[*it]; mdf(*it, -1); ++nrk;
        ++rkk[*it]; mdff(*it, 1); --nrkk;
		++it;
	}
    mdf(pos[y], nrk-rk[pos[y]]);
    mdff(pos[y], nrkk-rkk[pos[y]]);
	st[bin2[x].c].erase(st[bin2[x].c].lower_bound(pos[x]));
	st[bin2[x].c].insert(pos[y]);
	it=st[bin2[y].c].lower_bound(pos[y]);
	int nrk2=rk[*it], nrkk2=rkk[*it]; rk[*it]=nrk; rkk[*it]=nrkk;
	if(it!=st[bin2[y].c].begin()) {
		--it;
		while((*it)>pos[x]){
			++rk[*it]; mdf(*it, 1); --nrk2;
            --rkk[*it]; mdff(*it, -1); ++nrkk2;
			if(it==st[bin2[y].c].begin()) break;
			--it;
		}
	}
	mdf(pos[x], nrk2-lstrk); rk[pos[x]]=nrk2;
    mdff( pos[x], nrkk2-lstrkk); rkk[pos[x]]=nrkk2;
	st[bin2[y].c].erase(st[bin2[y].c].lower_bound(pos[y]));
	st[bin2[y].c].insert(pos[x]);
	swap(rev[pos[x]], rev[pos[y]]);
	swap(pos[x], pos[y]);
}
inline void solve2(){
	sort(bin2.begin(), bin2.end());
	tot=bin2.size();
	vector<node2> swp;
	for(int i=0; i<tot; ++i){
		pos[i]=i; rev[i]=i; st[bin2[i].c].clear();
		for(int j=i+1; j<tot; ++j){
			if(bin2[i].a==bin2[j].a) continue;
			swp.emplace_back((node2){bin2[j].a-bin2[i].a, bin2[j].b-bin2[i].b, i, j});
		}
	}
    for(int i=1; i<=tot; ++i) tr[i]=trr[i]=0;
	for(int i=0; i<tot; ++i){
		st[bin2[i].c].insert(i);
		rk[i]=st[bin2[i].c].size();
        mdf(i, rk[i]);
	}
    for(int i=tot-1; i>=0; --i){
        rkk[i]=st[bin2[i].c].size()+1-rk[i];
        mdff(i, rkk[i]);
    }
	sort(swp.begin(), swp.end());
	int p=0;
	for(int i=1; i<=m; ++i){
		while(p<(int)swp.size()&&chk2(swp[p].a, swp[p].b, v[i].b, -v[i].a)) work2(swp[p].x, swp[p].y), ++p;
        if(v[i].b>=0){
            int l=0, r=tot-1, res=-1;
            while(l<=r){
                int mid=(l+r)>>1;
                if((ll)bin2[rev[mid]].a*v[i].a+(ll)bin2[rev[mid]].b*v[i].b+v[i].c<0) {res=mid, l=mid+1;}
                else r=mid-1;
            }
            out[v[i].id]+=2ll*get(res); out[v[i].id]-=res+1;
        }
        else{
            int l=0, r=tot-1, res=tot;
            while(l<=r){
                int mid=(l+r)>>1;
                if((ll)bin2[rev[mid]].a*v[i].a+(ll)bin2[rev[mid]].b*v[i].b+v[i].c<0) {res=mid, r=mid-1;}
                else l=mid+1;
            }
            out[v[i].id]+=2ll*gett(res); out[v[i].id]-=tot-res;
        }
	}
}
int main(){
	// freopen("D:\\nya\\acm\\B\\test.in","r",stdin);
	// freopen("D:\\nya\\acm\\B\\test2.out","w",stdout);
    fin>>n>>m; B=sqrt(m)*0.6;
	for(int i=1, x, y, z; i<=n; ++i){
		fin>>x>>y>>z;
        vec[z].emplace_back(x, y);
	}
	for(int i=1; i<=m; ++i){
		fin>>v[i].a>>v[i].b>>v[i].c; v[i].id=i;
	}
	sort(v+1, v+m+1);
	for(int i=1; i<=n; ++i){
		if((int)vec[i].size()>=B){
			for(int l=0; l<(int)vec[i].size(); l+=B){
				bin.clear();
				for(int r=0; r<B&&l+r<(int)vec[i].size(); ++r){
					bin.emplace_back(vec[i][l+r]);
				}
				solve();
			}
			for(int i=1; i<=m; ++i) {
				out[i]+=(ll)ans[i]*ans[i];
				ans[i]=0;
			}
		}
		else{
			for(auto t:vec[i]) bin2.push_back((node3){t.fi, t.se, i});
			if((int)bin2.size()>=B) solve2(), bin2.clear();
		}
	}
	if(bin2.size()) solve2();
	for(int i=1; i<=m; ++i) fout<<out[i], fout.pc('\n');
	return 0;
}