#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l) == r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 100010;
int n, q, s[MAX_N], t[MAX_N];
int a[MAX_N], b[MAX_N], c[MAX_N], res[MAX_N];
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >> q;
for (int i = 0;i < n;++i) cin >> s[i] >> t[i];
for (int i = 0;i < q;++i) cin >> a[i] >> b[i] >> c[i];
if (n <= 3000 && q <= 3000) {
for (int i = 0;i < q;++i) {
for (int j = 0;j < n;++j) {
res[i] += ( s[j] >= a[i] &&
t[j] >= b[i] &&
s[j] + t[j] >= c[i] );
}
}
}
for (int i = 0;i < q;++i)
cout << res[i] << '\n';
}
