#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1000'000'007LL;
const int N = 1000'007;
pair<int, int> tab[N];
int h[N];
int Que(int p, int k)
{
int ans = -1;
vector<pair<int, int>> v;
multiset<int> cur;
for(int i = p; i <= k; ++i)
{
v.pb(make_pair(tab[i].st, h[i]));
v.pb(make_pair(tab[i].nd + 1, -h[i]));
}
sort(v.begin(), v.end());
for(int i = 0; i < (int)v.size(); ++i)
{
if(v[i].nd < 0)
cur.erase(cur.find(-v[i].nd));
else
cur.insert(v[i].nd);
if((int)cur.size() > 1)
ans = max(ans, *cur.rbegin() - *cur.begin());
}
return ans;
}
void Solve()
{
int n, q, a, b;
cin >> n;
for(int i = 1; i <= n; ++i)
cin >> h[i] >> tab[i].st >> tab[i].nd;
cin >> q;
for(int i = 1; i <= q; ++i)
{
cin >> a >> b;
cout << Que(a, b) << "\n";
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
//int t; cin >> t;
//while(t--)
Solve();
return 0;
}
