#include <bits/stdc++.h>
                
using namespace std;

typedef long long ll;

int n, q;

struct node
{
    ll x, y, v, a, b;
};
vector<node> v(200005);

int main()
{
    freopen("modern.in", "r", stdin);
    freopen("modern.out", "w", stdout);
            
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
    cin >> n >> q;
    for(int i = 1; i <= n; ++i)
    {
        cin >> v[i].x >> v[i].y >> v[i].v;
        ll a = 1, b = 1;
        while(a*2 <= v[i].x)
            a *= 2;
        while(b*2 <= v[i].y)
            b *= 2;
        v[i].a = a, v[i].b = b;
    }
    
    for(int i = 1; i <= q; ++i)
    {
        ll r, c;
        cin >> r >> c;
        ll ans = 0;
        for(int i = 1; i <= n; ++i)
        {
            if(r >= v[i].x && (r-v[i].x)%v[i].a == 0 && c >= v[i].y && (c-v[i].y)%v[i].b == 0)
                ans += v[i].v;
        }
        cout << ans << '\n';
    }
    
   	return 0;
}