#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define pob pop_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
ll n,m,k,l,q;
void test() {
cout<<"test"<<endl;
}
int main() {
cin>>n>>q;
vector<pll> students;
vector<pair<pll,ll> > queries;
students.resize(n);
queries.resize(q);
for(int i=0; i<n; i++) {
cin>>students[i].st>>students[i].nd;
}
for(int i=0; i<q; i++) {
cin>>queries[i].st.st>>queries[i].st.nd>>queries[i].nd;
}
for(int i=0; i<q; i++) {
ll s = 0;
for(int j=0; j<n; j++) {
if(students[j].st >= queries[i].st.st and (students[j].nd >= queries[i].st.nd) and students[j].st + students[j].nd >= queries[i].nd) s++;
}
cout<<s<<endl;
}
return 0;
}
