#pragma GCC optimize("Ofast")
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <codecvt>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
using namespace std;
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 3e5 + 10;
const int MOD = 1e9 + 7;
#define int long long
int rnd(int x, int y) {
int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
struct student {
int s, t;
};
bool cmp(student a, student b) {
return a.s < b.s;
}
struct query {
int x, y, z, id;
};
bool cmp2(query a, query b) {
return a.x > b.x;
}
int bit[MAXN];
void add(int x, int v) {
for(;x<MAXN;x+=x&-x) bit[x] += v;
}
int sum(int x) {
int s=0;
for(;x;x-=x&-x) s += bit[x];
return s;
}
void solve(int tc) {
int n, q;
cin >> n >> q;
if(n <= 3000 && q <= 3000) {
int s[n+1], t[n+1];
for(int i=1; i<=n; i++) cin >> s[i] >> t[i];
for(int i=1; i<=q; i++) {
int ans = 0;
int x, y, z;
cin >> x >> y >> z;
for(int j=1; j<=n; j++) {
ans += (s[j] >= x && t[j] >= y && s[j] + t[j] >= z);
}
cout << ans << "\n";
}
}
else {
student p[n+1];
for(int i=1; i<=n; i++) cin >> p[i].s >> p[i].t;
sort(p+1, p+n+1, cmp);
query r[q+1];
for(int i=1; i<=q; i++) {
cin >> r[i].x >> r[i].y >> r[i].z;
r[i].id = i;
}
sort(r+1, r+q+1, cmp2);
int ans[q+1];
int cur = n+1;
for(int i=1; i<=q; i++) {
while(cur > 1 && p[cur-1].s >= r[i].x) {
cur--;
add(p[cur].t + 1, 1);
}
ans[r[i].id] = sum(100001) - sum(r[i].y);
}
for(int i=1; i<=q; i++) cout << ans[i] << "\n";
}
}
int32_t main(){
ios::sync_with_stdio(0); cin.tie(0);
int t = 1; //cin >> t;
for(int i=1; i<=t; i++) solve(i);
}
