#include <bits/stdc++.h>
using namespace std;
const int kN = 1e5;
int N, sol[kN], aib[1 + 2 * kN];
struct student {
int x, y, z, index;
} a[2 * kN];
bool cmp1(const student &lhs, const student &rhs) {
return lhs.z > rhs.z;
}
bool cmp2(const student &lhs, const student &rhs) {
if (lhs.x != rhs.x) {
return lhs.x > rhs.x;
}
return lhs.index < rhs.index;
}
void update(int x, int v) {
for (int i = x; i <= N; i += i & -i) {
aib[i] += v;
}
}
int query(int x) {
int ans = 0;
for (int i = x; i > 0; i = i & (i - 1)) {
ans += aib[i];
}
return ans;
}
int query(int l, int r) {
return query(r) - query(l - 1);
}
void solve(int l, int r) {
if (r <= l) {
return;
}
int mid = (l + r) / 2;
vector<student> ev;
for (int i = l; i <= mid; ++i) {
if (a[i].index == -1) {
ev.emplace_back(a[i]);
}
}
for (int i = mid + 1; i <= r; ++i) {
if (a[i].index != -1) {
ev.emplace_back(a[i]);
}
}
sort(ev.begin(), ev.end(), cmp2);
vector<int> updates;
for (auto it : ev) {
int y = it.y, index = it.index;
if (index == -1) {
update(y, 1);
updates.emplace_back(y);
} else {
sol[index] += query(y, N);
}
}
ev.clear();
for (int y : updates) {
update(y, -1);
}
updates.clear();
solve(l, mid);
solve(mid + 1, r);
}
void testCase() {
int n, q;
cin >> n >> q;
vector<int> ys(n + q);
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
a[i] = {x, y, x + y, -1};
ys[i] = y;
}
for (int i = 0; i < q; ++i) {
int x, y, z;
cin >> x >> y >> z;
a[n + i] = {x, y, z, i};
ys[n + i] = y;
}
int m = n + q;
sort(a, a + m, cmp1);
sort(ys.begin(), ys.end());
ys.erase(unique(ys.begin(), ys.end()), ys.end());
N = ys.size();
for (int i = 0; i < m; ++i) {
a[i].y = distance(ys.begin(), upper_bound(ys.begin(), ys.end(), a[i].y));
}
ys.clear();
solve(0, m - 1);
for (int i = 0; i < q; ++i) {
cout << sol[i] << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int tests = 1;
for (int tc = 0; tc < tests; ++tc) {
testCase();
}
return 0;
}
