#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
using namespace __gnu_pbds;
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
#define int long long
#define ll long long
#define pii pair<int,int>
#define ar array
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
template<class T> using st = tree<T, null_type, less_equal<T>,
rb_tree_tag, tree_order_statistics_node_update>;
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
const int md = 998244353;
int binpow(int a, int b){
if(b == 0)return 1;
if(b % 2 == 0){
int c = binpow(a,b/2);
return (c*c)%mod;
}
return (binpow(a,b-1)*a)%mod;
}
int divi(int a, int b){
return (a*(binpow(b,mod-2)))%mod;
}
int n,m,k;
st<int>t[N];
void add(int i, int v){
i = N - i - 1;
for(;i<N;i+=(i&-i)) t[i].insert(v);
}
int get(int i, int v){
int r = 0;
i = N - i - 1;
for(;i>0;i-=(i&-i)) r += (t[i].size() - t[i].order_of_key(v));
return r;
}
void solve(){
cin >> n >> m;
vector<pii>v(n);
vector<int>a,b;
vector<int>r,rt;
for(int i = 0;i<n;i++){
cin >> v[i].f >> v[i].s;
r.pb(v[i].s);
rt.pb(v[i].f+v[i].s);
}
sort(all(v));
sort(all(r));
sort(all(rt));
for(int i = 0;i<n;i++){
a.pb(v[i].s);
b.pb(v[i].f+v[i].s);
}
vector<array<int,4>>q(m);
for(int i = 0;i<m;i++){
cin >> q[i][0] >> q[i][1] >> q[i][2];
q[i][3] = i;
}
vector<int>ans(m);
sort(rall(q));
int cur = n - 1;
for(int i = 0;i<m;i++){
while(cur >= 0 && v[cur].f >= q[i][0]){
int x = lower_bound(all(r), a[cur]) - r.begin();
int y = lower_bound(all(rt), b[cur]) - rt.begin();
add(x, y);
cur -= 1;
}
k = lower_bound(all(r), q[i][1]) - r.begin();
int l = lower_bound(all(rt), q[i][2]) - rt.begin();
ans[q[i][3]] = get(k, l);
}
for(auto to:ans)cout << to << "\n";
}
/*
5 4
35 100
70 70
45 15
80 40
20 95
20 50 0
10 10 0
60 60 0
0 100 0
*/
signed main()
{
// freopen("seq.in", "r", stdin);
// freopen("seq.out", "w", stdout);
ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
int tt=1;//cin>>tt;
while(tt--)solve();
}
