#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 100005;
const int inf = 1e9 + 5;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k) print the k-th smallest number in os(0-based)
int n, q;
array<int,4> niz[maxn];
array<int,4> upit[maxn];
int res[maxn];
struct fenwik {
ll dud[maxn];
void upd(int x, ll val) {
while(x <= maxn) {
dud[x] += val;
x += x&(-x);
}
}
ll query(int x) {
ll sum = 0;
while(x > 0) {
sum += dud[x];
x -= x&(-x);
}
return sum;
}
} fw[2];
int main()
{
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
cin >> n >> q;
ff(i,1,n) {
int S, T;
cin >> S >> T;
niz[i] = {S + T, S, T, i};
}
ff(i,1,q) {
int A, B, C;
cin >> A >> B >> C;
C = max(C, A + B);
upit[i] = {C, A, B, i};
}
{
vector<int> all;
ff(i,1,n)all.pb(niz[i][1]);
ff(i,1,q)all.pb(upit[i][1]);
sort(all(all));
all.erase(unique(all(all)), all.end());
ff(i,1,n)niz[i][1] = lower_bound(all(all), niz[i][1]) - all.begin() + 1;
ff(i,1,q)upit[i][1] = lower_bound(all(all), upit[i][1]) - all.begin() + 1;
}
{
vector<int> all;
ff(i,1,n)all.pb(niz[i][2]);
ff(i,1,q)all.pb(upit[i][2]);
sort(all(all));
all.erase(unique(all(all)), all.end());
ff(i,1,n)niz[i][2] = lower_bound(all(all), niz[i][2]) - all.begin() + 1;
ff(i,1,q)upit[i][2] = lower_bound(all(all), upit[i][2]) - all.begin() + 1;
}
sort(niz + 1, niz + n + 1);
reverse(niz + 1, niz + n + 1);
sort(upit + 1, upit + q + 1);
reverse(upit + 1, upit + q + 1);
int j = 0;
ff(i,1,q) {
while(j + 1 <= n && niz[j + 1][0] >= upit[i][0]) {
j += 1;
fw[0].upd(niz[j][1], 1);
fw[1].upd(niz[j][2], 1);
}
res[upit[i][3]] = j - fw[0].query(upit[i][1] - 1) - fw[1].query(upit[i][2] - 1);
}
ff(i,1,q)cout << res[i] << '\n';
return 0;
}
/**
// probati bojenje sahovski ili slicno
**/
