#include <bits/stdc++.h>
using namespace std;
#define name "code"
#define MAXN 200005
#define pb push_back
#define pf push_front
#define ll long long
#define ii pair<int, int>
#define fs first
#define sc second
#define ill pair<int, ll>
#define lli pair<ll, int>
#define llll pair<ll, ll>
#define all(v) v.begin(),v.end()
#define uni(v) v.erase(unique(all(v)),v.end())
#define bit(n,i) (((n)>>(i))&1)
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--)
#define MASK(i) (1LL<<(i))
const int INF=1e9;
const int MOD=1e9+7;
void add(int &u, int v){
u+=v;
if (u>=MOD) u-=MOD;
}
void sub(int &u, int v){
u-=v;
if (u<0) u+=MOD;
}
void minimize(int &u, int v){
u=min(u,v);
}
void maximize(int &u, int v){
u=max(u,v);
}
long long Rand(long long l, long long r){
ll tmp=0;
FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand()));
return l+tmp%(r-l+1);
}
int n,q;
ii a[MAXN];
bool cmp(const ii &A, const ii &B){
return A.fs+A.sc>B.fs+B.sc;
}
struct query{
int x,y,z,id;
bool operator <(const query& other) const{
return z>other.z;
}
}query[MAXN];
vector<int> vec[MAXN],bit[MAXN];
vector<int> store;
void fake_update(int x, int y){
for (; x>0; x-=x&-x) vec[x].pb(y);
}
void fake_get(int x, int y){
for (; x<=(int)store.size(); x+=x&-x) vec[x].pb(y);
}
void update(int x, int y){
for (; x>0; x-=x&-x){
for (int v=lower_bound(all(vec[x]),y)-vec[x].begin(); v>0; v-=v&-v) bit[x][v]++;
}
}
int get(int x, int y){
int res=0;
for (; x<=(int)store.size(); x+=x&-x){
for (int v=lower_bound(all(vec[x]),y)-vec[x].begin(); v<(int)vec[x].size(); v+=v&-v) res+=bit[x][v];
}
return res;
}
int right_most[MAXN];
int kq[MAXN];
int main()
{
// freopen(name".inp","r",stdin);
// freopen(name".out","w",stdout);
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin>>n>>q;
FOR(i,1,n) cin>>a[i].fs>>a[i].sc;
sort(a+1,a+n+1,cmp);
FOR(i,1,q){
cin>>query[i].x>>query[i].y>>query[i].z;
query[i].id=i;
}
sort(query+1,query+q+1);
int j=1;
FOR(i,1,q){
while (j<=n&&a[j].fs+a[j].sc>=query[i].z) ++j;
right_most[i]=j-1;
}
FOR(i,1,n) store.pb(a[i].fs);
FOR(i,1,q) store.pb(query[i].x);
sort(all(store));
uni(store);
FOR(i,1,n) a[i].fs=lower_bound(all(store),a[i].fs)-store.begin()+1;
FOR(i,1,q) query[i].x=lower_bound(all(store),query[i].x)-store.begin()+1;
FOR(i,1,n) fake_update(a[i].fs,a[i].sc);
FOR(i,1,q) fake_get(query[i].x,query[i].y);
FOR(i,1,MAXN-1){
vec[i].pb(-1);
sort(all(vec[i]));
uni(vec[i]);
bit[i].resize((int)vec[i].size(),0);
}
j=1;
FOR(i,1,q){
while (j<=right_most[i]){
update(a[j].fs,a[j].sc);
++j;
}
kq[query[i].id]=get(query[i].x,query[i].y);
}
FOR(i,1,q) cout<<kq[i]<<"\n";
return 0;
}
