#ifndef Local
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "/STACK:1024000000,1024000000")
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define popCnt(x) (__builtin_popcountll(x))
typedef long long Long;
typedef pair<int, int> pi;
const int N = 7e5 + 5;
map<int, int> mp;
template<class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
void compress() {
int curr = 0;
for (auto& p : mp) {
p.second = ++curr;
}
assert(curr < N);
}
template<int SZ> struct mstree {
Tree<pi> val[SZ + 1]; // for offline queries use vector with binary search instead
void upd(int x, int y, int t = 1) { // x-coordinate between 1 and SZ inclusive
for (int X = x; X <= SZ; X += X & -X) {
if (t == 1)
val[X].insert( { y, x });
else
val[X].erase( { y, x });
}
}
int query(int x, int y) {
assert(x >= 0 && y >= 0);
int t = 0;
for (; x > 0; x -= x & -x)
t += val[x].order_of_key( { y, N });
return t;
}
int query(int lox, int hix, int loy, int hiy) { // query number of elements within a rectangle
return query(hix, hiy) - query(lox - 1, hiy) - query(hix, loy - 1)
+ query(lox - 1, loy - 1);
}
};
mstree<N> bit;
struct Score {
int x, y;
int sum;
bool operator<(const Score& other) const {
return sum < other.sum;
}
};
struct Query {
int x, y, z;
int ind;
int res;
bool operator<(const Query& other) const {
return z < other.z;
}
};
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cerr.tie(0);
#ifdef Local
freopen("test.in", "r", stdin);
#else
#define endl '\n'
#endif
int n, q;
cin >> n >> q;
vector<Score> scores(n);
vector<Query> queries(q);
for (auto& score : scores) {
cin >> score.x >> score.y;
score.sum = score.x + score.y;
}
while (q--) {
int x , y , z;
cin >> x >> y >> z;
int res = 0;
for (auto& score : scores) {
if (score.x >= x && score.y >= y && score.sum >= z) {
++res;
}
}
cout << res << endl;
}
}
