#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9;
int n, m, ans[100100], t[400400];
int find(int x) {
int re = 0;
while(x) re += t[x], x -= x & -x;
return re;
}
void solve(vector<array<int, 2>> p, vector<array<int, 4>> q) {
sort(p.begin(), p.end());
sort(q.rbegin(), q.rend());
vector<int> Y;
for(auto [x, y] : p) Y.push_back(y);
sort(Y.begin(), Y.end()), Y.erase(unique(Y.begin(), Y.end()), Y.end());
auto lb = [&](int x) { return lower_bound(Y.begin(), Y.end(), x) - Y.begin() + 1; };
auto ub = [&](int x) { return upper_bound(Y.begin(), Y.end(), x) - Y.begin() + 1; };
memset(t, 0, sizeof t);
for(auto [x, l, r, i] : q) {
while(!p.empty() && p.back()[0] >= x) {
auto [x, y] = p.back(); p.pop_back();
for(int b=lb(y);b<=Y.size();b+=b&-b) t[b]++;
}
ans[abs(i)] += (find(ub(r)-1) - find(lb(l)-1)) * (i > 0 ? 1 : -1);
}
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin >> n >> m;
vector<array<int, 2>> p(n);
for(auto &[x, y] : p) cin >> x >> y;
vector<array<int, 4>> q1, q2;
for(int i=1;i<=m;i++) {
int a, b, c; cin >> a >> b >> c;
if(a+b >= c) q1.push_back({a, b, INF, i});
else {
q1.push_back({a, c-a, INF, i});
q2.push_back({c, 0, c-a-1, i});
q2.push_back({c, 0, b-1, -i});
}
}
solve(p, q1);
for(auto &[x, y] : p) x += y;
solve(p, q2);
for(int i=1;i<=m;i++) cout << ans[i] << "\n";
}
