#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update>
#define int long long
#define double long double
#define pii pair <int, int>
#define tiii tuple <int, int, int>
#define tiiii tuple <int, int, int, int>
#define tiiiii tuple <int, int, int, int, int>
#define emb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define iShowSpeed cin.tie(NULL)->sync_with_stdio(false)
#define matrix vector <vector <int>>
#define mat(n, m) vector <vector <int>> (n, vector <int> (m));
const int mod = 1e9 + 7;
const int inf = 1e18;
const matrix II = {{1, 0}, {0, 1}};
const int N = 2e5 + 5;
int fenwick[N];
void update(int idx, int val){
while (idx < N) {
fenwick[idx] += val;
idx += idx & -idx;
}
}
int query(int idx){
int sum = 0;
while (idx > 0) {
sum += fenwick[idx];
idx -= idx & -idx;
}
return sum;
}
vector <tiiiii> v;
int ans[N];
set <int> compress;
map <int, int> comp;
void cdq(int l, int r){
if (l == r) return;
int mid = (l + r) / 2;
cdq(l, mid), cdq(mid + 1, r);
vector <tiiiii> left, right;
for (int i = l; i <= mid; i++) {
auto [a, b, c, idx, que] = v[i];
left.emb(b, c, 0, idx, que);
}
for (int i = mid + 1; i <= r; i++) {
auto [a, b, c, idx, que] = v[i];
right.emb(b, c, 0, idx, que);
}
sort(rall(left)), sort(rall(right));
int i = 0, j = 0;
while (j < right.size()) {
auto [a, b, c, idx, que] = right[j++];
if (!que) continue;
while (i < left.size() && get <0> (left[i]) >= a) {
if (get <4> (left[i]) == 0) update(get <1> (left[i]), 1);
i++;
}
ans[idx] += query(N - 1) - query(b - 1);
}
i = 0, j = 0;
while (j < right.size()) {
auto [a, b, c, idx, que] = right[j++];
if (!que) continue;
while (i < left.size() && get <0> (left[i]) >= a) {
if (get <4> (left[i]) == 0) update(get <1> (left[i]), -1);
i++;
}
}
}
void solve(){
int n, q; cin >> n >> q;
for (int i = 1; i <= n; i++) {
int x, y; cin >> x >> y;
v.emb(x, y, x + y, i, 0);
compress.emplace(x + y);
}
for (int i = 1; i <= q; i++) {
int x, y, z; cin >> x >> y >> z;
v.emb(x, y, z, i, -1);
compress.emplace(z);
}
sort(rall(v));
int idx = 1;
for (auto e : compress) comp[e] = idx++;
for (auto &[x, y, z, idx, que] : v) {
z = comp[z];
}
cdq(0, v.size() - 1);
for (int i = 1; i <= q; i++) cout << ans[i] << "\n";
}
int32_t main(){
iShowSpeed;
// int q; cin >> q; while (q--)
solve();
}
