#include <iostream>
#include <vector>
#include <array>
using namespace std;
using ll = long long;
int n, q;
vector <pair <ll, ll>> ppl;
vector <array <ll, 3>> queries;
void subtask1() {
for (int i = 0; i < q; i++) {
int ans = 0;
ll a = queries[i][0], b = queries[i][1], c = queries[i][2];
for (int j = 0; j < n; j++) {
if (ppl[j].first + ppl[j].second >= c && ppl[j].first >= a && ppl[j].second >= b)
ans++;
}
cout << ans << '\n';
}
}
int main() {
cin >> n >> q;
ppl.resize(n);
queries.resize(q);
for (int i = 0; i < n; i++)
cin >> ppl[i].first >> ppl[i].second;
for (int i = 0; i < q; i++)
cin >> queries[i][0] >> queries[i][1] >> queries[i][2];
if (n <= 3000 && q <= 3000)
subtask1();
}
