#include <bits/stdc++.h>
#define i23 long long
const int dx[4] = {-1, 1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const int MOD = 1'000'000'007;
const int INF = 1e9;
inline void yn(int a) {
std::cout << (a == 1 ? "Yes" : "No") << '\n';
}
void solve() {
int n, q;
std::cin >> n >> q;
std::vector<int> s(n), t(n);
for (int i = 0; i < n; i++) {
std::cin >> s[i] >> t[i];
}
while (q--) {
int a, b, c;
std::cin >> a >> b >> c;
int res = 0;
for (int i = 0; i < n; i++) {
if (s[i] >= a and t[i] >= b and s[i] + t[i] >= c) {
res += 1;
}
}
std::cout << res << '\n';
}
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
std::cout.tie(0);
std::cin.exceptions(std::ios::badbit|std::ios::failbit);
int test = 1;
// std::cin >> test;
while (test-- > 0) {
solve();
}
return 0;
}
