#include <bits/stdc++.h> using namespace std; #define print(l) for(auto i:l) cout<<i<<" ";cout<<endl; #define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i]; #define int long long #define pb push_back #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> #define all(l) l.begin(),l.end() #define pii pair<int,int> #define fi first #define se second const int M = 1e9+7; const int inf = 1e18; int bp(int x, int y, int p){ int res = 1; x = x % p; while (y > 0) { if (y & 1) res = (res * x) % p; y = y >> 1; x = (x * x) % p; } return res; } int MI(int n, int p){ return bp(n, p - 2, p); } int mul(int x,int y, int p){ return x * 1ull * y % p; } int di(int x,int y, int p){ return mul(x, MI(y, p), p); } int n , m , k , q; void solve(int testcase_number){ cin>>n>>q; int b = 1e9+1; vector<vector<int>>ord; for(int i = 0;i<n;i++){ int s,t; cin>>s>>t; ord.pb({s,t}); } sort(all(ord)); reverse(all(ord)); vector<vector<int>>qur; for(int i =0 ;i<q;i++){ int x,y,z; cin>>x>>y>>z; qur.pb({x,y,i}); } sort(all(qur)); reverse(all(qur)); // for(auto i:ord){ // print(i); // } // for(auto i:qur){ // print(i); // } multiset<int>ms; int p1 =0; int p2 =0 ; vector<int>ans(q); while(p1 < n and p2<q){ // cout<<qur[p2][0]<<" "<<qur[p2][1]<<" "<<qur[p2][2]<<endl; while(p1<n and ord[p1][0] >= qur[p2][0]){ ms.insert(ord[p1][1]); p1++; } auto c = ms.lower_bound(qur[p2][1]); ans[qur[p2][2]] = ms.size()-distance(ms.begin(),c); p2++; } while(p2<q){ auto c = ms.lower_bound(qur[p2][1]); ans[qur[p2][2]] = ms.size()-distance(ms.begin(),c); p2++; } print(ans); } signed main(){ ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE cin.tie(0), cout.tie(0); cout << fixed<<setprecision(9); int t = 1; // cin>>t; for(int i = 1;i<=t;i++){ solve(i); } }