/*
* @Author: MaxPhast
* @File: test.cpp
* @Date: 2025-11-15 22:51:13
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ii pair <int , int>
#define iii pair <int , ii>
#define iiii pair <ii , ii>
#define FOR(i , l , r) for(int i = (l) , _r = (r) ; i <= _r ; ++ i)
#define FORD(i , r , l) for(int i = (r) , _l = (l) ; i >= _l ; -- i)
#define ALL(vec) vec.begin() , vec.end()
#define UNI(vec) sort(ALL(vec)) , vec.erase(unique(ALL(vec)) , vec.end())
#define pb push_back
#define MASK(i) (1ll << i)
#define BIT(mask , i) ((mask >> i) & 1ll)
#define ON(mask , i) (mask | MASK(i))
#define OFF(mask , i) (mask & (~MASK(i)))
#define TURN(mask , i) (mask ^ MASK(i))
#define BP(mask) __builtin_popcountll(mask)
#define sqr(x) (1ll * (x) * (x))
#define fi first
#define se second
#define oo 1e18
#define time() cerr << " \n " << "Time : " << 1000.0 * clock() / CLOCKS_PER_SEC << "ms."
#define IO(TASK) if(fopen(#TASK".INP" , "r")){freopen(#TASK".INP" , "r" , stdin); freopen(#TASK".OUT" , "w" , stdout);}
template <class X , class Y>
bool maxz(X &a , const Y b)
{
if(a < b)
{
a = b;
return true;
}
return false;
}
template <class X , class Y>
bool minz(X &a , const Y b)
{
if(a > b)
{
a = b;
return true;
}
return false;
}
namespace MaxPhast
{
const int N = 2e5 + 5;
int n , q;
int h[N] , a[N] , b[N] , res[N << 2] , ans[N];
vector <int> event[N];
vector <ii> qr[N];
struct Node
{
int mn , mx , ans;
Node()
{
mn = oo;
mx = -oo;
ans = -oo;
}
Node(int _mn , int _mx)
{
mn = _mn;
mx = _mx;
ans = -oo;
}
}it[N << 2];
struct Lazy
{
int mn , mx;
Lazy()
{
mn = oo;
mx = -oo;
}
}lazy[N << 2];
void down(int id)
{
minz(lazy[id << 1].mn , lazy[id].mn);
minz(lazy[id << 1 | 1].mn , lazy[id].mn);
maxz(lazy[id << 1].mx , lazy[id].mx);
maxz(lazy[id << 1 | 1].mx , lazy[id].mx);
maxz(it[id << 1].ans , max(it[id << 1].mx - lazy[id << 1].mn , lazy[id << 1].mx - it[id << 1].mn));
maxz(it[id << 1 | 1].ans , max(it[id << 1 | 1].mx - lazy[id << 1 | 1].mn , lazy[id << 1 | 1].mx - it[id << 1 | 1].mn));
lazy[id] = Lazy();
}
void up_point(int id , int l , int r , int pos , Node val)
{
if(pos < l || pos > r)
return;
if(l == r)
{
it[id] = val;
lazy[id] = Lazy();
return;
}
int mid = l + r >> 1;
down(id);
up_point(id << 1 , l , mid , pos , val);
up_point(id << 1 | 1 , mid + 1 , r , pos , val);
it[id].mn = min(it[id << 1].mn , it[id << 1 | 1].mn);
it[id].mx = max(it[id << 1].mx , it[id << 1 | 1].mx);
it[id].ans = max(it[id << 1].ans , it[id << 1 | 1].ans);
}
void up_range(int id , int l , int r , int u , int v , int val)
{
if(l > v || r < u)
return;
if(l >= u && r <= v)
{
minz(lazy[id].mn , val);
maxz(lazy[id].mx , val);
maxz(it[id].ans , max(it[id].mx - lazy[id].mn , lazy[id].mx - it[id].mn));
return;
}
int mid = l + r >> 1;
down(id);
up_range(id << 1 , l , mid , u , v , val);
up_range(id << 1 | 1 , mid + 1 , r , u , v , val);
it[id].ans = max(it[id << 1].ans , it[id << 1 | 1].ans);
}
int get(int id , int l , int r , int u , int v)
{
if(l > v || r < u)
return -oo;
if(l >= u && r <= v)
return it[id].ans;
int mid = l + r >> 1;
down(id);
return max(get(id << 1 , l , mid , u , v) ,
get(id << 1 | 1 , mid + 1 , r , u , v));
}
void update(int id , int l , int r , int pos , int val)
{
if(pos < l || pos > r)
return;
if(l == r)
{
res[id] = val;
return;
}
int mid = l + r >> 1;
update(id << 1 , l , mid , pos , val);
update(id << 1 | 1 , mid + 1 , r , pos , val);
res[id] = max(res[id << 1] , res[id << 1 | 1]);
}
int query(int id , int l , int r , int u , int v)
{
if(l > v || r < u)
return -oo;
if(l >= u && r <= v)
return res[id];
int mid = l + r >> 1;
return max(query(id << 1 , l , mid , u , v) ,
query(id << 1 | 1 , mid + 1 , r , u , v));
}
void solve()
{
cin >> n;
FOR(i , 1 , n)
cin >> h[i] >> a[i] >> b[i];
cin >> q;
FOR(i , 1 , q)
{
int l , r; cin >> l >> r;
qr[r].pb({l , i});
}
FOR(i , 1 , n)
{
int l = min(n + 1 , i + a[i]) , r = min(n , i + b[i]);
event[l].pb(i);
event[r + 1].pb(-i);
}
FOR(i , 1 , 4 * n) res[i] = -oo;
memset(ans , -1 , sizeof(ans));
FOR(i , 1 , n)
{
for(int &x : event[i])
{
if(x > 0)
up_point(1 , 1 , n , x , Node(h[x] , h[x]));
else
{
update(1 , 1 , n , -x , get(1 , 1 , n , -x , -x));
up_point(1 , 1 , n , -x , Node());
}
}
up_range(1 , 1 , n , i - b[i] , i - a[i] , h[i]);
for(ii &it : qr[i])
{
maxz(ans[it.se] , get(1 , 1 , n , it.fi , i));
maxz(ans[it.se] , query(1 , 1 , n , it.fi , i));
}
}
FOR(i , 1 , q)
cout << ans[i] << "\n";
}
}
signed main()
{
ios_base :: sync_with_stdio(false) ; cin.tie(nullptr) ; cout.tie(nullptr) ;
IO(test);
MaxPhast :: solve();
time();
}
/*
*/
