#include <bits/stdc++.h>
using namespace std;

int n, q, b[2000005], tot; 
struct Node {
    int a, b, c, id; 
    bool operator< (const Node &a) const { 
        if (this->a != a.a) return this->a > a.a; 
        if (this->b != a.b) return this->b > a.b; 
        if (this->c != a.c) return this->c > a.c; 
        return this->id < a.id; 
    }
} a[200005], T[200005]; 
int ans[100005]; 

int C[2000005]; 
void add(int x, int k) { for (; x; x -= x & -x) C[x] += k; }
int sum(int x) { int r = 0; for (; x <= tot; x += x & -x) r += C[x]; return r; }
void CDQ(int l, int r) {
    if (l == r) return; 
    int mid = l + r >> 1; CDQ(l, mid); CDQ(mid + 1, r); 
    int p = l, q = mid + 1; 
    for (int i = l; i <= r; ++i) {
        if (p <= mid && (q > r || a[p].b >= a[q].b)) {
            if (!a[p].id) add(a[p].c, 1); 
            T[i] = a[p++]; 
        } else {
            if (a[q].id) ans[a[q].id] += sum(a[q].c); 
            T[i] = a[q++]; 
        }
    }
    for (int i = l; i <= mid; ++i) if (!a[i].id) add(a[i].c, -1); 
    for (int i = l; i <= r; ++i) a[i] = T[i]; 
}

int main(void) {
    ios::sync_with_stdio(0); 
    cin >> n >> q; 
    for (int i = 1; i <= n; ++i) cin >> a[i].a >> a[i].b, a[i].c = a[i].a + a[i].b, b[++tot] = a[i].a, b[++tot] = a[i].b, b[++tot] = a[i].c; 
    for (int i = n + 1; i <= n + q; ++i) cin >> a[i].a >> a[i].b >> a[i].c, a[i].id = i - n, b[++tot] = a[i].a, b[++tot] = a[i].b, b[++tot] = a[i].c; 
    sort(b + 1, b + tot + 1); tot = unique(b + 1, b + tot + 1) - b - 1; 
    auto find = [&] (int &x) { return x = lower_bound(b + 1, b + tot + 1, x) - b; }; 
    for (int i = 1; i <= n + q; ++i) find(a[i].a), find(a[i].b), find(a[i].c); 
    sort(a + 1, a + n + q + 1); 
    CDQ(1, n + q); 
    for (int i = 1; i <= q; ++i) cout << ans[i] << "\n"; 
    return 0;
}