#include <bits/stdc++.h>
using i64 = long long;
using namespace std;
constexpr int N = 100000;
struct Node {
int s;
Node *l, *r;
Node() : s(0), l(nullptr), r(nullptr) {}
};
Node *r[N + 1];
void add(Node *&p, int l, int r, int x) {
if (p == nullptr) {
p = new Node();
}
p->s++;
if (l == r - 1) {
return;
}
int m = (l + r) / 2;
if (x < m) {
add(p->l, l, m, x);
} else {
add(p->r, m, r, x);
}
}
int query(Node *p, int l, int r, int x) {
if (p == nullptr || r <= x)
return 0;
if (x <= l) {
return p->s;
}
int m = (l + r) / 2;
return query(p->l, l, m, x) + query(p->r, m, r, x);
}
void addPoint(int x, int y) {
x = N - x - 1;
for (int i = x + 1; i <= N; i += i & -i) {
add(r[i], 0, N, y);
}
}
int ask(int x, int y) {
x = N - x - 1;
int ans = 0;
for (int i = x + 1; i > 0; i -= i & -i) {
ans += query(r[i], 0, N, y);
}
return ans;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, q;
cin >> n >> q;
vector<int> a(n), b(n), c(n);
vector<int> A, B, C;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
c[i] = a[i] + b[i];
A.push_back(a[i]);
B.push_back(b[i]);
C.push_back(c[i]);
}
sort(A.begin(), A.end());
sort(B.begin(), B.end());
sort(C.begin(), C.end());
A.erase(unique(A.begin(), A.end()), A.end());
B.erase(unique(B.begin(), B.end()), B.end());
C.erase(unique(C.begin(), C.end()), C.end());
for (int i = 0; i < n; i++) {
a[i] = lower_bound(A.begin(), A.end(), a[i]) - A.begin();
b[i] = lower_bound(B.begin(), B.end(), b[i]) - B.begin();
c[i] = lower_bound(C.begin(), C.end(), c[i]) - C.begin();
}
vector<int> x(q), y(q), z(q);
for (int i = 0; i < q; i++) {
cin >> x[i] >> y[i] >> z[i];
x[i] = lower_bound(A.begin(), A.end(), x[i]) - A.begin();
y[i] = lower_bound(B.begin(), B.end(), y[i]) - B.begin();
z[i] = lower_bound(C.begin(), C.end(), z[i]) - C.begin();
}
vector<array<int, 3>> p;
for (int i = 0; i < n; i++) {
p.push_back({c[i], i, 0});
}
for (int i = 0; i < q; i++) {
p.push_back({z[i], i, 1});
}
sort(p.begin(), p.end(), [&](const auto &a, const auto &b) {
if (a[0] == b[0]) {
return a[2] < b[2];
} else {
return a[0] > b[0];
}
});
vector<int> ans(q);
for (auto [_, i, gg] : p) {
if (gg == 0) {
addPoint(a[i], b[i]);
} else {
ans[i] = ask(x[i], y[i]);
}
}
for (int i = 0; i < q; i++) {
cout << ans[i] << "\n";
}
return 0;
}
