#pragma gcc diagnostic "-std=c++1z"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).rend()
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
using namespace std;
const int N=1e5+5;
int n,m,T,k,a[N],b[N],x[N],y[N],z[N],ans[N];
pair<pii,int> ab[N];
ordered_set t[N*4];
void build(int v, int tl, int tr) {
if (tl==tr) {
t[v].insert(a[tl]+b[tl]); return;
}
int mid=(tl+tr)/2;
build(v*2,tl,mid); build(v*2+1,mid+1,tr);
for (auto x:t[v*2]) t[v].insert(x);
for (auto x:t[v*2+1]) t[v].insert(x);
}
void update(int v, int tl, int tr, int ind, int val) {
int xx=t[v].order_of_key(a[ind]+b[ind]);
if (xx<t[v].size()) t[v].erase(t[v].find_by_order(xx));
// t[v].erase(t[v].lower_bound(a[ind]+b[ind]));
if (tl==tr) return;
int mid=(tl+tr)/2;
if (ind<=mid) update(v*2,tl,mid,ind,val);
else update(v*2+1,mid+1,tr,ind,val);
}
int query(int v, int tl, int tr, int l, int r, int val) {
if (l>r) return 0;
if (tl==l && tr==r) {
int num=t[v].order_of_key(val); int szz=t[v].size(); num=szz-num;
return num;
}
int mid=(tl+tr)/2;
return query(v*2,tl,mid,l,min(r,mid),val)+query(v*2+1,mid+1,tr,max(l,mid+1),r,val);
}
void test_case() {
cin>>n>>m;
for (int i=1; i<=n; i++) cin>>ab[i].f.f>>ab[i].f.s;
for (int i=1; i<=n; i++) ab[i].s=i;
sort(ab+1,ab+1+n);
for (int i=1; i<=n; i++) {
a[i]=ab[i].f.f; b[i]=ab[i].f.s;
}
for (int i=1; i<=m; i++) cin>>x[i]>>y[i]>>z[i];
pii bi[n+1],yi[m+1]; bi[0]={0,0}; yi[0]={0,0};
for (int i=1; i<=n; i++) {
bi[i]={b[i],i};
}
for (int i=1; i<=m; i++) {
yi[i]={y[i],i};
}
sort(bi+1,bi+1+n); sort(yi+1,yi+1+m);
int cur=1;
build(1,1,n);
for (int i=1; i<=m; i++) {
int ind=yi[i].s;
while (cur<=n && bi[cur].f<yi[i].f) {
cout<<"POS "<<i<<" "<<ind<<" "<<bi[cur].s<<endl;
update(1,1,n,bi[cur].s,-1); cur++;
}
int l=1,r=n,idx=n+1;
while (l<=r) {
int mid=(l+r)/2;
if (a[mid]>=x[ind]) {
idx=mid; r=mid-1;
}
else {
l=mid+1;
}
}
ans[ind]=query(1,1,n,idx,n,z[ind]);
cout<<i<<" "<<idx<<" "<<ans[ind]<<endl;
}
for (int i=1; i<=m; i++) cout<<ans[i]<<endl;
}
main () {
ios :: sync_with_stdio(0);
cin.tie(0); cout.tie(0);
T=1;
while (T--) test_case();
}
