#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n,q;
struct node {
    ll x,y,v,a,b;
}a[100010];
ll find (ll x) {
    while (1) {
        if (x-(x&-x)==0) return x;
        x-=(x&-x); 
    }
}
int main () {
    freopen("modern.in","r",stdin);
    freopen("modern.out","w",stdout);
    cin >> n >> q;
    for (int i=1;i<=n;i++) {
        cin >> a[i].x >> a[i].y >> a[i].v;
        a[i].a=find(a[i].x),a[i].b=find(a[i].y);
    }
    while (q--) {
        ll r,c;
        cin >> r >> c;
        ll res=0;
        for (int i=1;i<=n;i++) {
            if ((r-a[i].x)%a[i].a==0&&(c-a[i].y)%a[i].b==0) res+=a[i].v;
        }
        cout << res <<endl;
    }
    return 0;
}