/*
VENI VIDI VICI
*/
// #pragma GCC optimize("Ofast","unroll-all-loops","fast-math","no-stack-protector","give-no-fuck")
#include <bits/stdc++.h>
// #include <iostream>
// #include <vector>
// #include <algorithm>
// #include <set>
// #include <map>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define rep(i,x, n) for (int i = (x); i < (n); ++i)
#define repr(i,x, n) for (int i = (n) - 1; i >= (x); --i)
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
// #define sum accumulate
//using i128 = __int128;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;
using sll = set<ll>;
template<class T>
istream& operator>>(istream& is, vector<T>& v) {
for(auto &i:v) is>>i;
return is;
}
template<class T1,class T2>
istream& operator>>(istream& is, pair<T1,T2>& p) {
is>>p.fi>>p.se;
return is;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
for(const auto &i:v) os<<i<<' ';
return os;
}
template<class T1,class T2>
ostream& operator<<(ostream& os, const pair<T1,T2>& p) {
os<<p.fi<<' '<<p.se; return os;
}
void pyn(bool x)
{
cout<<(x?"YES":"NO")<<endl;
}
void pYN(bool x)
{
cout<<(x?"Yes":"No")<<endl;
}
void pAB(bool x)
{
cout<<(x?"Alice":"Bob")<<endl;
}
ll powmod(ll a,ll b,ll modulo)
{
if(b==0){
return 1;
}
ll temp=powmod(a,b/2,modulo);
if(b%2==0){
return (temp*temp)%modulo;
}
else{
return (a*((temp*temp)%modulo))%modulo;
}
}
bool Prime(ll n){
for (ll i = 2; i*i <= n; i++)
if (n % i == 0)
return false;
return (n>1);
}
void readIO() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
void solve();
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// readIO();
int uwu=1;
// cin>>uwu;
for(int tc=1;tc<=uwu;tc++) {
// cout<<"Case #"<<tc<<": ";
solve();
}
return 0;
}
const int N=2e5+100,KP=1e7;;
int s[N],t[N],x[N],y[N],z[N],szy,ans[N];
struct FenwickTree
{
map<int,int> mp;
int mx;
FenwickTree(int apl)
{
mx=apl+2;
}
void Add(int y)
{
y++;
while(y>0)
{
mp[y]++;
y-=(y&-y);
}
}
int query(int y)
{
int ans=0;
y++;
while(y<mx)
{
auto it=mp.find(y);
if(it!=end(mp))
{
ans+=it->second;
}
y+=(y&-y);
}
return ans;
}
};
FenwickTree *fen[N];
void Add(int x,int y)
{
x++;
while(x>0)
{
if(fen[x]==NULL)
{
fen[x]=new FenwickTree(szy);
}
fen[x]->Add(y);
x-=(x&-x);
}
}
int query(int x,int y)
{
x++;
int ans=0;
while(x<N)
{
if(fen[x]!=NULL)
{
ans+=fen[x]->query(y);
}
x+=(x&-x);
}
return ans;
}
void solve()
{
ll n,q;
cin>>n>>q;
vector<vl> event;
set<ll> curx,cury;
for(int i=1;i<=n;i++)
{
cin>>s[i]>>t[i];
curx.insert(s[i]);
cury.insert(t[i]);
event.push_back({-s[i]-t[i],-1,i});
}
for(int i=1;i<=q;i++)
{
cin>>x[i]>>y[i]>>z[i];
curx.insert(x[i]);
cury.insert(y[i]);
// cur.insert(z[i]);
z[i]=max(z[i],x[i]+y[i]);
event.push_back({-z[i],1,i});
}
vl pressx(all(curx));
vl pressy(all(cury));
sort(all(event));
for(int i=1;i<=n;i++)
{
s[i]=lower_bound(all(pressx),s[i])-begin(pressx);
t[i]=lower_bound(all(pressy),t[i])-begin(pressy);
}
for(int i=1;i<=q;i++)
{
x[i]=lower_bound(all(pressx),x[i])-begin(pressx);
y[i]=lower_bound(all(pressy),y[i])-begin(pressy);
}
ll sz=pressx.size();
szy=pressy.size();
// FenwickTree2D *st=new FenwickTree2D(0,sz);
// ds
for(auto c:event)
{
if(c[1]==-1)
{
Add(s[c[2]],t[c[2]]);
}
else
{
ans[c[2]]=query(x[c[2]],y[c[2]]);
}
}
for(int i=1;i<=q;i++)
{
cout<<ans[i]<<endl;
}
}
