#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu
bool cmp(array<int, 4> a, array<int, 4> b)
{
if(a[2] != b[2])
{
return a[2] > b[2];
}
return a[3] < b[3];
}
struct BIT
{
int n;
vector<int> bit;
BIT(int n_now)
{
n = n_now;
bit.assign(n+1, 0);
}
void add(int idx, int delta)
{
for(int i = idx; i <= n; i = i|(i+1))
{
bit[i]+=delta;
}
}
int get(int l)
{
int sum = 0;
for(int i = l; i >= 0; i = (i&(i+1))-1)
{
sum+=bit[i];
}
return sum;
}
int get(int l, int r)
{
return get(r)-get(l-1);
}
};
void solve()
{
int n, q;
cin >> n >> q;
vector<array<int, 4>> queries;
vector<int> ans(q);
vector<int> vals;
for(int i = 0; i < n; i++)
{
int a, b;
cin >> a >> b;
vals.pb(a);
vals.pb(b);
queries.pb({a, b, a+b, -1});
}
for(int i = 0; i < q; i++)
{
int a, b, c;
cin >> a >> b >> c;
vals.pb(a);
vals.pb(b);
queries.pb({a, b, max(a+b, c), i});
}
sort(all(vals));
auto idx = [&](int a) {
return lower_bound(vals.begin(), vals.end(), a) - vals.begin() + 1;
};
int total = 0;
sort(all(queries), cmp);
BIT a(500005), b(500005);
for(auto x : queries)
{
if(x[3] == -1)
{
a.add(idx(x[0]), 1);
b.add(idx(x[1]), 1);
total++;
}
else
{
ans[x[3]] = a.get(idx(x[0]), 500005)+b.get(idx(x[1]), 500005)-total;
}
}
for(int i = 0; i < q; i++)
{
cout << ans[i] << endl;
}
}
int32_t main(){
startt
int t = 1;
//cin >> t;
while (t--) {
solve();
}
}
/*
5 4
35 100
70 70
45 15
80 40
20 95
20 50 120
10 10 100
60 60 80
0 100 100
*/
