#include<iostream>
#include<cmath>
using namespace std;
int n,m;
struct nod{long long xi,yi,ai,bi;int col;}lis[200010];
long long f(long long x){
	int p=0;
	while(x) x/=2,p++;
	return pow(2,p-1);
}
int main(){
    freopen("modern.in","r",stdin);
    freopen("modern.out","w",stdout);
    
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
    	long long xi,yi;int vi;scanf("%lld%lld%d",&xi,&yi,&vi);
    	lis[i].xi=xi;
    	lis[i].ai=f(xi);
    	lis[i].yi=yi;
    	lis[i].bi=f(yi);
    	lis[i].col=vi;
	}
	while(m--){
		long long rj,cj;scanf("%lld%lld",&rj,&cj);
		int col=0;
		for(int i=1;i<=n;i++) if(rj>=lis[i].xi&&(rj-lis[i].xi)%lis[i].ai==0&&cj>=lis[i].yi&&(cj-lis[i].yi)%lis[i].bi==0) col+=lis[i].col;
		printf("%d\n",col);
	}
	
    return 0;
}