#include<bits/stdc++.h>
using namespace std;
long long n,q,a[100010],ans,dp[2010][3],nm[2010][3];
int main(){
    freopen("modern.in","r",stdin);
    freopen("modern.out","w",stdout);
    cin>>n>>q;
    for(int i=1;i<=n;i++){
        int x,y,v;
        cin>>x>>y>>v;
        nm[i][1]=x,nm[i][2]=y,nm[i][3]=v;
        int j=1;
        while(j<=x){
            j*=2;
        }
        j/=2;
        dp[i][1]=j;
        j=1;
        while(j<=y){
            j*=2;
        }
        j/=2;
        dp[i][2]=j;
    }
    while(q--){
        int x,y,ans=0;
        cin>>x>>y;
        for(int i=1;i<=n;i++){
            if(((x-nm[i][1])%dp[i][1]==0&&(y-nm[i][2])%dp[i][2]==0)&&(x>=nm[i][1]&&y>=nm[i][2])){
                ans+=nm[i][3];
            }
        } 
        cout<<ans<<endl;
    }
    return 0;
}