#include <bits/stdc++.h>

using namespace std;
#define int long long

struct Node {
    int a, b, c, ind, cost;
};

struct BIT {
    vector<int> f;
    int N;

    void init(int n) {
        N = n + 2;
        f.resize(n + 2, 0);
    }

    void update(int i, int val) {
        for (; i < N; i += (i & (-i)))
            f[i] += val;
    }

    int sum(int r) {
        int res = 0;
        for (; r > 0; r -= (r & (-r)))
            res += f[r];
        return res;
    }
};

const int N = (int) 1e6 + 10;

vector<Node> v;
int ans[N];

BIT bit;

void DivideAndConquer(int l, int r) {
    if (l == r) return;
    int mid = (l + r) / 2, a = l, b = mid + 1, sum = 0;
    DivideAndConquer(l, mid), DivideAndConquer(mid + 1, r);
    vector<pair<int, int>> record;
    vector<Node> tmp;
    while (a <= mid && b <= r) {
        if (v[a].b >= v[b].b) {
            bit.update(v[a].c, v[a].cost), record.emplace_back(v[a].c, v[a].cost);
            sum += v[a].cost, tmp.emplace_back(v[a++]);
        } else {
            ans[v[b].ind] += sum - bit.sum(v[b].c - 1), tmp.emplace_back(v[b++]);
        }
    }
    while (a <= mid) tmp.emplace_back(v[a++]);
    while (b <= r) ans[v[b].ind] += sum - bit.sum(v[b].c - 1), tmp.emplace_back(v[b++]);
    for (int i = 0; i < (int) tmp.size() - 1; i++)
        if (tmp[i].b < tmp[i + 1].b) exit(-1);
    for (auto [ind, val]: record) bit.update(ind, -val);
    for (int i = l; i <= r; i++) v[i] = tmp[i - l];
}

set<int> all;
map<int, int> to;

void compress(vector<int> &a) {
    all.clear(), to.clear();
    int cnt = 1;
    for (int i: a) all.insert(i);
    for (int i: all) to[i] = cnt++;
    for (int &i: a) i = to[i];
}

void solve() {
    vector<int> A, B, C;
    for (Node i: v) A.emplace_back(i.a), B.emplace_back(i.b), C.emplace_back(i.c);
    compress(A), compress(B), compress(C);
    for (int i = 0; i < (int) v.size(); i++) v[i].a = A[i], v[i].b = B[i], v[i].c = C[i];
    int mx = 0;
    for (int i = 0; i < (int) v.size(); i++) mx = max({mx, v[i].a, v[i].b, v[i].c});
    bit.init(mx + 1);
    sort(v.begin(), v.end(), [&](Node a, Node b) {
        return (a.a != b.a ? a.a > b.a : (a.b != b.b ? a.b > b.b : a.c > b.c));
    });
    DivideAndConquer(0, (int) v.size() - 1);
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    int n, q;
    cin >> n >> q;
    for (int i = 0; i < n; i++) {
        int s, t;
        cin >> s >> t;
        v.emplace_back(s, t, s + t, q + i, 1);
    }
    for (int i = 0; i < q; i++) {
        int x, y, z;
        cin >> x >> y >> z;
        v.emplace_back(x, y, z, i, 0);
    }
    solve();
    for (int i = 0; i < q; i++)
        cout << ans[i] << "\n";
    return 0;
}