#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define rep for(int i=0;i<=1;i++)
using namespace std;
typedef long long ll;
struct kd
{
	int ls,rs,sm[2],sn[2],v[2];
	ll sum,s;
	kd (int a,int b,int c){ls=rs=0,sm[0]=sn[0]=v[0]=a,sm[1]=sn[1]=v[1]=b,s=sum=c;}
	kd (){}
};
kd t[100010];
int n,m,D,root;
ll A,B,C;
bool cmp(kd a,kd b)
{
	return (a.v[D]==b.v[D])?(a.v[D^1]<b.v[D^1]):(a.v[D]<b.v[D]);
}
void pushup(int x,int y)
{
	rep	t[x].sm[i]=max(t[x].sm[i],t[y].sm[i]),t[x].sn[i]=min(t[x].sn[i],t[y].sn[i]);
	t[x].sum+=t[y].sum; 
}
int build(int l,int r,int d)
{
	if(l>r)	return 0;
	int mid=l+r>>1;
	D=d;
	nth_element(t+l,t+mid,t+r+1,cmp);
	t[mid].ls=build(l,mid-1,d^1),t[mid].rs=build(mid+1,r,d^1);
	if(t[mid].ls)	pushup(mid,t[mid].ls);
	if(t[mid].rs)	pushup(mid,t[mid].rs);
	return mid;
}
int check(int x)
{
	int ret=0;
	ret+=(A*t[x].sn[0]+B*t[x].sn[1]<C);
	ret+=(A*t[x].sm[0]+B*t[x].sn[1]<C);
	ret+=(A*t[x].sm[0]+B*t[x].sm[1]<C);
	ret+=(A*t[x].sn[0]+B*t[x].sm[1]<C);
	return ret;
}
ll query(int x)
{
	if(!x||!check(x))	return 0;
	if(check(x)==4)	return t[x].sum;
	ll ret=0;
	if(A*t[x].v[0]+B*t[x].v[1]<C)	ret+=t[x].s;
	ret+=query(t[x].ls)+query(t[x].rs);
	return ret;
}
int main()
{
	scanf("%d%d",&n,&m);
	int i,a,b,c;
	for(i=1;i<=n;i++)
	{
		scanf("%d%d%d",&a,&b,&c);
		t[i]=kd(a,b,c);
	}
	root=build(1,n,0);
	for(i=1;i<=m;i++)
	{
		scanf("%lld%lld%lld",&A,&B,&C);
		printf("%lld\n",query(root));
	}
	return 0;
}