# include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pii pair <int, int>
using namespace std;
const int N = 5e5 + 5;
int n,q,a[N],b[N],c[N],x[N],y[N],z[N],mx,id,cnt,cur,pas[N];
unordered_map <int, int> shes;
vector <int> tocomp;
unordered_map <int, int> tree[4*N];
vector < pii > vec[4*N],v,v1;
void updatefenw(int node, int idx, int val) {
for (int i = idx; i <= mx; i+=i&(-i)) {
tree[node][i] += val;
}
}
int getfenw(int node, int le, int ri) {
int pas = 0;
for (int i = ri; i > 0 ; i -= i&(-i)) {
pas += tree[node][i];
}
for (int i = le - 1; i > 0; i-=i&(-i)) {
pas -= tree[node][i];
}
return pas;
}
void update(int node, int le ,int ri, int idx, int val) {
if (le > idx || ri < idx) return ;
if (le == ri) {
vec[node].pb({val,1});
updatefenw(node,val,1);
return ;
}
int mid = (le + ri) / 2;
update(2 * node, le, mid , idx, val);
update(2*node + 1, mid + 1, ri, idx, val);
vec[node] = vec[2*node];
tree[node] = tree[2*node];
for (int i = 0; i < vec[2*node + 1].size(); i++) {
vec[node].pb({vec[2*node + 1][i].f, vec[2*node +1][i].s});
updatefenw(node, vec[2*node + 1][i].f, vec[2*node + 1][i].s);
}
}
int getans(int node, int le, int ri, int start, int end, int val1) {
if (le > end || ri < start) return 0;
if (le >= start && ri <= end) {
return getfenw(node,val1,mx);
}
int mid = (le + ri) / 2;
return getans(2*node, le, mid,start,end,val1) + getans(2*node + 1, mid + 1, ri, start,end,val1);
}
void add(int idx) {
id = v[idx].s;
update(1,1,mx,a[id],b[id]);
}
main() {
std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>n>>q;
for (int i = 1; i <= n; i++) {
cin>>a[i]>>b[i];
tocomp.pb(a[i]);tocomp.pb(b[i]);
v.pb({a[i] + b[i],i});
}
sort(v.begin(),v.end());
reverse(v.begin(),v.end());
for (int i = 1; i <= q; i++) {
cin>>x[i]>>y[i]>>z[i];
tocomp.pb(x[i]);
tocomp.pb(y[i]);
v1.pb({z[i],i});
}
sort(tocomp.begin(),tocomp.end());
cnt = 1;
shes[tocomp[0]] = 1;
mx = 1;
for (int i = 1; i < tocomp.size(); i++) {
if (tocomp[i] != tocomp[i - 1]) cnt++;
mx = cnt;
shes[tocomp[i]] = cnt;
}
for (int i = 1; i <= n; i++) {
a[i] = shes[a[i]];
b[i] = shes[b[i]];
}for (int i = 1; i <= q; i++) {
x[i] = shes[x[i]]; y[i] = shes[y[i]];
}
sort(v1.begin(),v1.end());
reverse(v1.begin(),v1.end());
cur = 0;
for(int i = 0; i < v1.size(); i++) {
while (cur < v.size() && v[cur].f >= v1[i].f) {
add(cur);
cur++;
}
pas[v1[i].s] = getans(1,1,mx,x[v1[i].s],mx,y[v1[i].s]);
}
for (int i = 1; i <= q; i++) cout<<pas[i]<<" ";
}
