#include<bits/stdc++.h>
using namespace std;
#define task "a"
#define se second
#define fi first
#define ll long long
#define ii pair<ll, ll>
const long mxN = 1e5 + 7;
int n;
ii a[mxN];
vector<int> tree[mxN * 4], sum[mxN * 4];
void Build(int j = 1, int l = 1, int r = n)
{
if (l == r)
{
sum[j].push_back(a[l].fi + a[l].se);
tree[j].push_back(a[l].se);
return;
}
int mid = (l + r) / 2;
Build(j * 2, l, mid);
Build(j * 2 + 1, mid + 1, r);
merge(sum[j * 2].begin(), sum[j * 2].end(), sum[j * 2 + 1].begin(), sum[j * 2 + 1].end(), back_inserter(sum[j]));
merge(tree[j * 2].begin(), tree[j * 2].end(), tree[j * 2 + 1].begin(), tree[j * 2 + 1].end(), back_inserter(tree[j]));
}
int Get_sum(int u, int v, int val, int j = 1, int l = 1, int r = n)
{
if (a[l].fi >= v || a[r].fi < u)
return 0;
if (u <= a[l].fi && a[r].fi < v)
return r - l + 1 - (lower_bound(sum[j].begin(), sum[j].end(), val) - sum[j].begin());
int mid = (l + r) / 2;
return Get_sum(u, v, val, j * 2, l, mid) + Get_sum(u, v, val, j * 2 + 1, mid + 1, r);
}
int Get_b(int v, int val, int j = 1, int l = 1, int r = n)
{
if (a[r].fi < v)
return 0;
if (a[l].fi >= v)
return r - l + 1 - (lower_bound(tree[j].begin(), tree[j].end(), val) - tree[j].begin());
int mid = (l + r) / 2;
return Get_b(v, val, j * 2 + 1, mid + 1, r) + Get_b(v, val, j * 2, l, mid);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
//freopen(task".INP", "r", stdin);
//freopen(task".OUT", "w", stdout);
int q;
cin >> n >> q;
for (int i = 1; i <= n; i++)
cin >> a[i].fi >> a[i].se;
sort(a + 1, a + n + 1);
Build();
for (int i = 1; i <= q; i++)
{
int a, b, c;
cin >> a >> b >> c;
int tmp = max(a, c - b);
cout << Get_sum(a, tmp, c) + Get_b(tmp, b) << '\n';
}
}
