#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
struct pair_hash{
size_t operator()(const pair<int,int>&x)const{
return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
}
};
const int MAXQ = 1e5 + 7;
const int BASE = (1 << 20);
int ans[MAXQ];
int tree1[2 * BASE + 7];
int tree2[2 * BASE + 7];
vector<pair<pii, int>> points;
vector<pair<pii, int>> queriesSmall;
vector<pair<pii, pii>> queriesBig;
int n, q;
void upd(int ind, int val, int tree[]){
ind += BASE;
while(ind){
tree[ind] += val;
ind /= 2;
}
}
int query(int v, int l, int p, int a, int b, int tree[]){
if(b < l || p < a){
return 0;
}
if(a <= l && p <= b){
return tree[v];
}
int mid = (l + p) / 2;
return query(2 * v, l, mid, a, b, tree) + query(2 * v + 1, mid + 1, p, a, b, tree);
}
bool compSmall(pair<pii, int> x, pair<pii, int> y){
if(x.fi.se != y.fi.se){
return x.fi.se > y.fi.se;
}
if(x.fi.fi != y.fi.fi){
return x.fi.fi > y.fi.fi;
}
return x.se < y.se;
}
void solveSmall(){
vector<pair<pii, int>> vec;
for(auto ele : points){
vec.pb(mp(ele.fi, 0));
}
for(auto ele : queriesSmall){
vec.pb(mp(ele.fi, ele.se));
}
sort(all(vec), compSmall);
for(auto ele : vec){
if(ele.se == 0){
upd(ele.fi.fi, 1, tree1);
}else{
ans[ele.se] = query(1, 0, BASE - 1, ele.fi.fi, BASE - 1, tree1);
}
}
for(auto ele : points){
upd(ele.fi.fi, -1, tree1);
}
}
bool compBig(pair<pii, pii> x, pair<pii, pii> y){
if(x.se.fi != y.se.fi){
return x.se.fi > y.se.fi;
}
return x.se.se < y.se.se;
}
void solveBig(){
vector<pair<pii, pii>> vec;
for(auto ele : points){
vec.pb(mp(ele.fi, mp(ele.se, 0)));
}
for(auto ele : queriesBig){
vec.pb(ele);
}
sort(all(vec), compBig);
int add = 0;
for(auto ele : vec){
if(ele.se.se == 0){
upd(ele.fi.fi, 1, tree1);
upd(ele.fi.se, 1, tree2);
add++;
}else{
ans[ele.se.se] = query(1, 0, BASE - 1, ele.fi.fi, BASE - 1, tree1) + query(1, 0, BASE - 1, ele.fi.se, BASE - 1, tree2) - add;
}
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> q;
points.resize(n);
map<int, int> m;
for(int i = 0; i < n; i++){
cin >> points[i].fi.fi >> points[i].fi.se;
points[i].se = points[i].fi.fi + points[i].fi.se;
m[points[i].fi.fi] = m[points[i].fi.se] = 1;
}
for(int i = 1; i <= q; i++){
int x, y, z;
cin >> x >> y >> z;
if(x + y >= z){
queriesSmall.pb(mp(mp(x, y), i));
}else{
queriesBig.pb(mp(mp(x, y), mp(z, i)));
}
m[x] = m[y] = 1;
}
int xd = 1;
for(auto& ele : m){
ele.se = xd++;
}
for(auto& ele : points){
ele.fi.fi = m[ele.fi.fi];
ele.fi.se = m[ele.fi.se];
}
for(auto& ele : queriesSmall){
ele.fi.fi = m[ele.fi.fi];
ele.fi.se = m[ele.fi.se];
}
for(auto& ele : queriesBig){
ele.fi.fi = m[ele.fi.fi];
ele.fi.se = m[ele.fi.se];
}
solveSmall();
solveBig();
for(int i = 1; i <= q; i++){
cout << ans[i] << '\n';
}
return 0;
}
