#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
struct query { int A,B,C,i; };
pii s[100000];
vi a,b;
bool comp(pii a,pii b) {
return a.first+a.second > b.first+b.second;
}
bool comp2(query a,query b) {
return a.C > b.C;
}
query queries[100000];
int ans[100000];
vpii bit[100001];
int bit2[100001];
int main() {
int i;
int N,Q;
scanf("%d %d",&N,&Q);
for (i = 0; i < N; i++) {
scanf("%d %d",&s[i].first,&s[i].second);
a.pb(-s[i].first),b.pb(-s[i].second);
}
sort(s,s+N,comp);
sort(a.begin(),a.end());
a.resize(unique(a.begin(),a.end())-a.begin());
sort(b.begin(),b.end());
b.resize(unique(b.begin(),b.end())-b.begin());
for (i = 0; i < Q; i++) scanf("%d %d %d",&queries[i].A,&queries[i].B,&queries[i].C),queries[i].i = i;
sort(queries,queries+Q,comp2);
int j = 0,k;
for (i = 0; i < Q; i++) {
while ((j < N) && (s[j].first+s[j].second >= queries[i].C)) {
int x = lower_bound(a.begin(),a.end(),-s[j].first)-a.begin();
int y = lower_bound(b.begin(),b.end(),-s[j].second)-b.begin();
for (k = x+1; k <= a.size(); k += k & (-k)) bit[k].pb(mp(y,-1));
j++;
}
int x = upper_bound(a.begin(),a.end(),-queries[i].A)-a.begin()-1;
int y = upper_bound(b.begin(),b.end(),-queries[i].B)-b.begin()-1;
for (k = x+1; k > 0; k -= k & (-k)) bit[k].pb(mp(y,queries[i].i));
}
for (i = 1; i <= a.size(); i++) {
for (j = 0; j < bit[i].size(); j++) {
if (bit[i][j].second == -1) {
for (k = bit[i][j].first+1; k <= b.size(); k += k & (-k)) bit2[k]++;
}
else {
for (k = bit[i][j].first+1; k > 0; k -= k & (-k)) ans[bit[i][j].second] += bit2[k];
}
}
for (j = 0; j < bit[i].size(); j++) {
if (bit[i][j].second == -1) {
for (k = bit[i][j].first+1; k <= b.size(); k += k & (-k)) bit2[k] = 0;
}
}
}
for (i = 0; i < Q; i++) printf("%d\n",ans[i]);
return 0;
}
