#include<stdio.h>
long n,m,x[100001],y[100001];
FILE *g;

void solve (long x1, long y1, long long r)
	{
	long i;
	long long nr=0,aux1,aux2;
	for (i=1;i<=n;++i)
		{
		aux1=x[i]-x1;
		if (aux1<0)
			aux1=aux1*-1;
		aux2=y[i]-y1;
		if (aux2<0)
			aux2=aux2*-1;
		if (aux1+aux2==r)
			nr++;
		}
	fprintf(g,"%lld\n",nr);
	}

void read ()
	{
	FILE *f=fopen("grendizer.in","r");
	fscanf(f,"%ld%ld",&n,&m);
	long i,x1,y1;
	long long r;
	for (i=1;i<=n;++i)
		fscanf(f,"%ld%ld",&x[i],&y[i]);
	for (i=1;i<=m;++i)
		{
		fscanf(f,"%ld%ld%lld",&x1,&y1,&r);
		solve (x1,y1,r);
		}
	fclose(f);
	}

int main ()
{
g=fopen("grendizer.out","w");
read ();
return 0;
}