#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l << " \n"[next(l) == r], ++l; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 300010;
int n, h[MAX_N], a[MAX_N], b[MAX_N];
int q, ql[MAX_N], qr[MAX_N], res[MAX_N];
int32_t main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n ;
for (int i = 1;i <= n;++i)
cin >> h[i] >> a[i] >> b[i];
cin >> q;
for (int i = 1;i <= q;++i)
cin >> ql[i] >> qr[i];
if (n > 300) return -1;
auto valid = [&](int i, int j) {
int dis = abs(j - i);
return a[i] <= dis && dis <= b[i]
&& a[j] <= dis && dis <= b[j];
};
for (int i = 1;i <= q;++i) {
res[i] = -1;
for (int j = ql[i];j <= qr[i];++j)
for (int k = j + 1;k <= qr[i];++k) {
if (valid(j, k))
chmax(res[i], abs(h[j] - h[k]));
}
}
for (int i = 1;i <= q;++i)
cout << res[i] << '\n';
}
