#line 1 "Examination.cpp"
#include <bits/stdc++.h>
using namespace std;
#line 2 "algo/data-structure/pbds.hpp"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template <typename TK>
using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag,
tree_order_statistics_node_update>;
template <typename TK, typename TV>
using pbds_map =
tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
#line 6 "Examination.cpp"
signed main() {
int n, q;
cin >> n >> q;
vector<pair<int, int>> a(n);
vector<tuple<int, int, int, int>> query(q);
vector<int> ans(n);
auto sub2 = [&]() { // correct
for (auto &[s, t] : a) cin >> s >> t;
for (int i = 0; i < q; ++i) {
cin >> get<0>(query[i]) >> get<1>(query[i]) >> get<2>(query[i]);
get<3>(query[i]) = i;
}
sort(a.rbegin(), a.rend());
sort(query.rbegin(), query.rend());
pbds_set<pair<int, int>> s;
for (int i = 0, j = 0; i < q; ++i) {
while (j < n && a[j].first >= get<0>(query[i])) {
s.insert({a[j].second, j});
++j;
}
auto it = s.order_of_key({get<1>(query[i]), -1});
ans[get<3>(query[i])] = (int)s.size() - it;
}
};
sub2();
for (int i = 0; i < q; ++i) cout << ans[i] << '\n';
}
