#include <bits/stdc++.h>
using namespace std;
const int nx=2e5+5;
struct node
{
int x, y, z, i;
bool operator<(const node &o) const
{
if (x==o.x&&y==o.y&&z==o.z) return i<o.i;
if (x==o.x&&y==o.y) return z>o.z;
if (x==o.x) return y>o.y;
return x>o.x;
}
} d[nx], tmp[nx];
struct fenwick
{
int d[nx];
void add(int i, int vl)
{
while (i<nx) d[i]+=vl, i+=(i&-i);
}
int query(int i)
{
int res=0;
while (i>0) res+=d[i], i-=(i&-i);
return res;
}
} f;
int n, q, t, res[nx];
map<int, int> mp;
void solve(int l, int r)
{
if (l==r) return;
int md=(l+r)/2;
solve(l, md);
solve(md+1, r);
int idx=l;
//cout<<"here "<<l<<' '<<r<<'\n';
//for (int i=l; i<=r; i++) cout<<"value "<<d[i].i<<' '<<d[i].x<<' '<<d[i].y<<' '<<d[i].z<<'\n';
for (int i=l, j=md+1; idx<=r;)
{
if (j>r||(i<=md&&d[i].y>=d[j].y))
{
if (d[i].i==0) f.add(mp[d[i].z], 1);//cout<<"update "<<l<<' '<<r<<' '<<d[i].x<<' '<<d[i].y<<' '<<d[i].z<<' '<<mp[d[i].z]<<'\n', f.add(mp[d[i].z], 1);
tmp[idx++]=d[i++];
}
else
{
if (d[j].i!=0) res[d[j].i]+=f.query(nx-1)-f.query(mp[d[j].z]-1);//cout<<"query "<<l<<' '<<r<<' '<<d[j].i<<' '<<mp[d[j].z]<<'\n', res[d[j].i]+=f.query(nx-1)-f.query(mp[d[j].z]-1);
tmp[idx++]=d[j++];
}
}
for (int i=l; i<=md; i++) if (d[i].i==0) f.add(mp[d[i].z], -1);
for (int i=l; i<=r; i++) d[i]=tmp[i];
}
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>q;
for (int i=1; i<=n; i++) cin>>d[i].x>>d[i].y, d[i].z=d[i].x+d[i].y, d[i].i=0;
for (int i=n+1; i<=n+q; i++) cin>>d[i].x>>d[i].y>>d[i].z, d[i].i=i-n;
sort(d+1, d+n+q+1);
for (int i=1; i<=n+q; i++) mp[d[i].z]=0;
for (auto &[x, y]:mp) y=++t;
solve(1, n+q);
for (int i=1; i<=q;i ++) cout<<res[i]<<'\n';
}
