#include<stdio.h>
#include<algorithm>
using namespace std;
int n,m;
pair<int,int> *nr1,*nr2;
pair<int,int> v1[100002];
pair<int,int> v2[100002];

int main()
{
	freopen("grendizer.in","r",stdin);
	freopen("grendizer.out","w",stdout);
	scanf("%d%d",&n,&m);
	int x,y,r,i,sol=0;
	for(i=1;i<=n;i++)
	{
		scanf("%d%d",&x,&y);
		v1[i]=make_pair(x-y,y);
		v2[i]=make_pair(x+y,y);
	}
	sort(v1+1,v1+n+1);
	sort(v2+1,v2+n+1);
	for(i=1;i<=m;i++)
	{
		sol=0;
		scanf("%d%d%d",&x,&y,&r);
		nr1=lower_bound(v1+1,v1+n+1,make_pair(x-y-r,y));
		nr2=lower_bound(v1+1,v1+n+1,make_pair(x-y-r,y+r));
		sol=sol+nr2-nr1;
		nr1=lower_bound(v2+1,v2+n+1,make_pair(x+y-r,y-r));
		nr2=lower_bound(v2+1,v2+n+1,make_pair(x+y-r,y));
		sol=sol+nr2-nr1;
		nr1=upper_bound(v2+1,v2+n+1,make_pair(x+y+r,y));
		nr2=upper_bound(v2+1,v2+n+1,make_pair(x+y+r,y+r));
		sol=sol+nr2-nr1;
		nr1=upper_bound(v1+1,v1+n+1,make_pair(x-y+r,y-r));
		nr2=upper_bound(v1+1,v1+n+1,make_pair(x-y+r,y));
		sol=sol+nr2-nr1;
		printf("%d\n",sol);
	}
	return 0;
}