#include <bits/stdc++.h>
#define debug printf
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x.size() )
#define ll long long
const int MAXN = 2e5+10 ;
using namespace std ;
struct SparseSeg
{
vector< int > _sum, e , d ;
int create()
{
_sum.push_back(0) ;
e.push_back(0) ;
d.push_back(0) ;
return sz(e)-1 ;
}
int m(int l, int r) { return (l+r)>>1 ; }
void upd(int pos, int l, int r, int idx )
{
_sum[pos]++ ;
if( l == r ) return ;
int aux ;
if( idx <= m(l,r) )
{
if(e[pos] == 0 ) { aux = create() ; e[pos] = aux ; }
upd(e[pos] , l ,m(l,r), idx ) ;
}
else
{
if(d[pos] == 0 ) { aux = create() ; d[pos] = aux ; }
upd(d[pos] , m(l,r)+1, r, idx ) ;
}
}
int qry(int pos, int l, int r, int bValue )
{
if( r < bValue || !pos ) return 0 ;
if( l >= bValue ) return _sum[pos] ;
int al = qry(e[pos] , l , m(l,r) , bValue ) ;
int ar = qry(d[pos] , m(l,r) + 1 , r , bValue ) ;
return al + ar ;
}
} ;
int N , Q , keyA, keyB ;
vector<int> compressA, compressB ;
SparseSeg bit[MAXN] ;
void upd(int aValue, int bValue )
{
for(; aValue <= keyA ; aValue += aValue & -aValue)
bit[aValue].upd(1,1,keyB, bValue ) ;
}
int qry(int aValue, int bValue )
{
int tot = 0 ;
for(; aValue > 0 ; aValue -= aValue & -aValue )
tot += bit[aValue].qry(1,1,keyB, bValue ) ;
return tot ;
}
int main()
{
scanf("%d %d", &N, &Q ) ;
vector< pair<int,int> > sweep ;
vector< pair<int,int> > student(N+1) ;
vector< pair<int,int> > queries(Q+1) ;
vector<int> ansQueries(Q+1,0) ;
for(int i = 1 ; i <= N ; i++ )
{
scanf("%d %d", &student[i].first, &student[i].second ) ;
compressA.push_back(student[i].first) ;
compressB.push_back(student[i].second) ;
sweep.push_back( make_pair(student[i].first + student[i].second , i) ) ;
}
for(int i = 1 , C ; i <= Q ; i++ )
{
scanf("%d %d %d", &queries[i].first ,&queries[i].second, &C ) ;
compressA.push_back(queries[i].first) ;
compressB.push_back(queries[i].second) ;
sweep.push_back( make_pair(C, -i ) );
}
sort(all(compressA)) ; compressA.erase(unique(all(compressA) ) , compressA.end() ) ;
sort(all(compressB) ) ; compressB.erase(unique(all(compressB) ), compressB.end() ) ;
keyA = sz(compressA) ;
keyB = sz(compressB) ;
sort(all(sweep) ) ;
for(int i = 1 ; i <= keyA ; i++ ) bit[i].create() , bit[i].create() ;
for(int i = sz(sweep)-1 ; i >= 0 ; i-- )
{
auto e = sweep[i] ;
if( e.second > 0 )
{
int A = student[ e.second ].first ;
int B = student[ e.second ].second ;
A = lower_bound(all(compressA) , A ) - compressA.begin() + 1 ;
B = lower_bound(all(compressB) , B ) - compressB.begin() + 1 ;
upd( A , B ) ;
}
else
{
int idQuery = -e.second ;
int A = queries[idQuery].first ;
int B = queries[idQuery].second ;
A = lower_bound(all(compressA) , A ) - compressA.begin() + 1 ;
B = lower_bound(all(compressB) , B ) - compressB.begin() + 1;
ansQueries[idQuery] = qry(keyA, B) - qry(A-1, B) ;
}
}
for(int i = 1 ; i <= Q ; i++ ) printf("%d\n" , ansQueries[i]) ;
}
