#ifndef LOCAL
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#endif

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class t>
void print_single(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

template<class t,class u>
void print_single(const pair<t,u>&p,int suc=1){
	print_single(p.a,2);
	print_single(p.b,suc);
}

template<class T>
void print_single(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print_single(v[i],i==int(v.size())-1?suc:2);
}

template<class T>
void print_offset(const vector<T>&v,ll off,int suc=1){
	rep(i,v.size())
		print_single(v[i]+off,i==int(v.size())-1?suc:2);
}

template<class T,size_t N>
void print_single(const array<T,N>&v,int suc=1){
	rep(i,N)
		print_single(v[i],i==int(N)-1?suc:2);
}

template<class T>
void print(const T&t){
	print_single(t);
}

template<class T,class ...Args>
void print(const T&t,const Args&...args){
	print_single(t,2);
	print(args...);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

void YES(bool ex=true){
	cout<<"YES\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void NO(bool ex=true){
	cout<<"NO\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void Yes(bool ex=true){
	cout<<"Yes\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void No(bool ex=true){
	cout<<"No\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
//#define CAPITAL
/*
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}*/
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int topbit(ull t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int botbit(ull a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
int popcount(ull t){
	return __builtin_popcountll(t);
}
int bitparity(ll t){
	return __builtin_parityll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}
ull umask(int i){
	return (ull(1)<<i)-1;
}
ll minp2(ll n){
	if(n<=1)return 1;
	else return ll(1)<<(topbit(n-1)+1);
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	//#ifdef LOCAL
	static mt19937_64 gen;
	/*#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif*/
	return uniform_int_distribution<ll>(l, r)(gen);
}

ll rand_int(ll k){ //[0,k)
	return rand_int(0,k-1);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t,class u>
int lwb(const vc<t>&v,const u&a){
	return lower_bound(all(v),a)-v.bg;
}
template<class t,class u>
bool bis(const vc<t>&v,const u&a){
	return binary_search(all(v),a);
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

template<class t>
vc<t> presum(const vc<t>&a){
	vc<t> s(si(a)+1);
	rep(i,si(a))s[i+1]=s[i]+a[i];
	return s;
}
vc<ll> presum(const vi&a){
	vc<ll> s(si(a)+1);
	rep(i,si(a))s[i+1]=s[i]+a[i];
	return s;
}
//BIT で数列を管理するときに使う (CF850C)
template<class t>
vc<t> predif(vc<t> a){
	gnr(i,1,si(a))a[i]-=a[i-1];
	return a;
}
template<class t>
vvc<ll> imos(const vvc<t>&a){
	int n=si(a),m=si(a[0]);
	vvc<ll> b(n+1,vc<ll>(m+1));
	rep(i,n)rep(j,m)
		b[i+1][j+1]=b[i+1][j]+b[i][j+1]-b[i][j]+a[i][j];
	return b;
}

//verify してないや
void transvvc(int&n,int&m){
	swap(n,m);
}
template<class t,class... Args>
void transvvc(int&n,int&m,vvc<t>&a,Args&...args){
	assert(si(a)==n);
	vvc<t> b(m,vi(n));
	rep(i,n){
		assert(si(a[i])==m);
		rep(j,m)b[j][i]=a[i][j];
	}
	a.swap(b);
	transvvc(n,m,args...);
}
//CF854E
void rotvvc(int&n,int&m){
	swap(n,m);
}
template<class t,class... Args>
void rotvvc(int&n,int&m,vvc<t>&a,Args&...args){
	assert(si(a)==n);
	vvc<t> b(m,vi(n));
	rep(i,n){
		assert(si(a[i])==m);
		rep(j,m)b[m-1-j][i]=a[i][j];
	}
	a.swap(b);
	rotvvc(n,m,args...);
}

//ソートして i 番目が idx[i]
//CF850C
template<class t>
vi sortidx(const vc<t>&a){
	int n=si(a);
	vi idx(n);iota(all(idx),0);
	sort(all(idx),[&](int i,int j){return a[i]<a[j];});
	return idx;
}
//vs[i]=a[idx[i]]
//例えば sortidx で得た idx を使えば単にソート列になって返ってくる
//CF850C
template<class t>
vc<t> a_idx(const vc<t>&a,const vi&idx){
	int n=si(a);
	assert(si(idx)==n);
	vc<t> vs(n);
	rep(i,n)vs[i]=a[idx[i]];
	return vs;
}
//CF850C
vi invperm(const vi&p){
	int n=si(p);
	vi q(n);
	rep(i,n)q[p[i]]=i;
	return q;
}

template<class t,class s=t>
s SUM(const vc<t>&a){
	return accumulate(all(a),s(0));
}
template<class t,size_t K,class s=t>
s SUM(const array<t,K>&a){
	return accumulate(all(a),s(0));
}

template<class t>
t MAX(const vc<t>&a){
	return *max_element(all(a));
}

template<class t>
pair<t,int> MAXi(const vc<t>&a){
	auto itr=max_element(all(a));
	return mp(*itr,itr-a.bg);
}

template<class A>
auto MIN(const A&a){
	return *min_element(all(a));
}

template<class t>
pair<t,int> MINi(const vc<t>&a){
	auto itr=min_element(all(a));
	return mp(*itr,itr-a.bg);
}

vi vid(int n){
	vi res(n);iota(all(res),0);
	return res;
}

template<class S>
void soin(S&s){
	sort(all(s));
}

template<class S,class F>
void soin(S&s,F&&f){
	sort(all(s),forward<F>(f));
}

template<class S>
S soout(S s){
	soin(s);
	return s;
}

template<class S>
void rein(S&s){
	reverse(all(s));
}

template<class S>
S reout(S s){
	rein(s);
	return s;
}

template<class t,class u>
pair<t,u>&operator+=(pair<t,u>&a,pair<t,u> b){
	a.a+=b.a;a.b+=b.b;return a;}
template<class t,class u>
pair<t,u>&operator-=(pair<t,u>&a,pair<t,u> b){
	a.a-=b.a;a.b-=b.b;return a;}
template<class t,class u>
pair<t,u> operator+(pair<t,u> a,pair<t,u> b){return mp(a.a+b.a,a.b+b.b);}
template<class t,class u>
pair<t,u> operator-(pair<t,u> a,pair<t,u> b){return mp(a.a-b.a,a.b-b.b);}
template<class t,class u>
pair<t,u> operator-(pair<t,u> a){return mp(-a.a,-a.b);}
template<class t,class u>
istream&operator>>(istream&is,pair<t,u>&a){
	return is>>a.a>>a.b;
}

template<class t>
t gpp(vc<t>&vs){
	assert(si(vs));
	t res=move(vs.back());
	vs.pop_back();
	return res;
}

template<class t,class u>
void pb(vc<t>&a,const vc<u>&b){
	a.insert(a.ed,all(b));
}

template<class t,class...Args>
vc<t> cat(vc<t> a,Args&&...b){
	(pb(a,forward<Args>(b)),...);
	return a;
}

template<class t,class u>
vc<t>& operator+=(vc<t>&a,u x){
	for(auto&v:a)v+=x;
	return a;
}

template<class t,class u>
vc<t> operator+(vc<t> a,u x){
	return a+=x;
}

template<class t>
vc<t> operator+(const vc<t>&a,const vc<t>&b){
	vc<t> c(max(si(a),si(b)));
	rep(i,si(a))c[i]+=a[i];
	rep(i,si(b))c[i]+=b[i];
	return c;
}

template<class t,class u>
vc<t>& operator-=(vc<t>&a,u x){
	for(auto&v:a)v-=x;
	return a;
}

template<class t,class u>
vc<t>& operator-(vc<t> a,u x){
	return a-=x;
}

template<class t,class u>
void remval(vc<t>&a,const u&v){
	a.erase(remove(all(a),v),a.ed);
}
//消した要素の個数を返してくれる
//UCUP 2-8-F
template<class t,class F>
int remif(vc<t>&a,F f){
	auto itr=remove_if(all(a),f);
	int res=a.ed-itr;
	a.erase(itr,a.ed);
	return res;
}

template<class VS,class u>
void fila(VS&vs,const u&a){
	fill(all(vs),a);
}

template<class t,class u>
int findid(const vc<t>&vs,const u&a){
	auto itr=find(all(vs),a);
	if(itr==vs.ed)return -1;
	else return itr-vs.bg;
}

template<class t>
void rtt(vc<t>&vs,int i){
	rotate(vs.bg,vs.bg+i,vs.ed);
}

bool dbg=false;

int sgn(int a){
	return a>0?1:(a<0?-1:0);
}

int rabs(pi a){return max(abs(a.a),abs(a.b));}

int dot(pi a,pi b){
	return a.a*b.a+a.b*b.b;
}

pi add(pi a,pi b){
	return pi(a.a+b.a,a.b+b.b);
}
pi sub(pi a,pi b){
	return pi(a.a-b.a,a.b-b.b);
}

int crs(pi a,pi b){
	return a.a*b.b-a.b*b.a;
}

int ccw(pi a,pi b){
	return sgn(crs(a,b));
}

int ccw(pi a,pi b,pi c){
	return sgn(crs(sub(b,a),sub(c,a)));
}
//同じ x 座標には複数存在しないようにする
//stress-tested
//EC Final 2021 K (>=, no points on edges)
void add_convex_upper(vc<pi>&ps,pi v){
	if(si(ps)){
		assert(ps.back()<=v);
		if(ps.back().a==v.a)ps.pop_back();
	}
	while(si(ps)>=2&&ccw(ps[si(ps)-2],ps[si(ps)-1],v)>=0)ps.pop_back();
	ps.pb(v);
}
vc<pi> cat_convex_upper(vc<pi> a,const vc<pi>&b){
	for(auto v:b)add_convex_upper(a,v);
	return a;
}
//(a.a/a.b), (b.a/b.b) を比較
//分母が正のケースだけ stress-tested
int fcmp(pi a,pi b){
	if(a.b<0)a=-a;
	if(b.b<0)b=-b;
	int z=a.a*b.b-a.b*b.a;
	return z<0?-1:z==0?0:1;
}

//UCUP 2023-3 F
template<class F>
void segeasy(int s,int l,int r,F f){
	for(l+=s,r+=s;l<r;l>>=1,r>>=1){
		if(l&1)f(l);
		if(r&1)f(r-1);
		l++; //ceil l
	}
}
//include geo/pi
//点集合 (ソート済み) で init
//query(l,r,p,q)
//[l,r) 内で (p,q) との内積最大の点を返す
//内積最大の中でどの点を返しているかは謎です!すまん
//q>=0 が必要
//query をまとめて処理することでオーダーを落としている
//stress-tested
//EC Final 2021 K
struct CHT_Query{
	int n,s;
	vc<pi> rw;
	vvc<pi> z;
	vi head;
	CHT_Query(const vc<pi>&ps){
		assert(is_sorted(all(ps)));
		n=si(ps);
		s=minp2(n);
		rw=ps;
		z.resize(s*2);
		rep(i,n)z[s+i].pb(ps[i]);
		gnr(i,1,s)z[i]=cat_convex_upper(z[i*2],z[i*2+1]);
		head.resize(2*s);
	}
	struct Query{
		int l,r;
		pi dir;
	};
	vc<Query> qs;
	void add_query(int l,int r,int p,int q){
		assert(q>=0);
		assert(0<=l&&l<r&&r<=n);
		qs.pb({l,r,pi(p,q)});
	}
	vc<pi> calc(){
		vc<pi> ans(si(qs));
		vi idx;
		rep(qid,si(qs)){
			auto [l,r,dir]=qs[qid];
			if(dir.b==0){
				if(dir.a<=0)ans[qid]=rw[l];
				else ans[qid]=rw[r-1];
			}else{
				idx.pb(qid);
			}
		}
		soin(idx,[&](int i,int j){return ccw(qs[i].dir,qs[j].dir)<0;});
		const pi none=pi(-inf,-inf);
		fila(head,0);
		for(auto qid:idx){
			auto [l,r,dir]=qs[qid];
			auto eval=[&](pi v){return dot(v,dir);};
			pi cur=none;
			auto upd=[&](pi v){
				if(cur==none||dot(cur,dir)<dot(v,dir))cur=v;
			};
			segeasy(s,l,r,[&](int i){
				if(z[i].empty())return;
				int&j=head[i];
				while(j+1<si(z[i])&&eval(z[i][j])<eval(z[i][j+1]))j++;
				upd(z[i][j]);
			});
			ans[qid]=cur;
		}
		qs.clear();
		return ans;
	}
};

//f(x) が ] -1 | 0 | 1 [ みたいな形をしているとする
//f(0)<=0 を仮定
//f(inf)=1 を仮定
//f(x)=0 なる x を見つけてくる．
//分母最小，その中で分子最小を見つける
//f(x)=0 なる call の中で最後のやつが答えになっている
//stress-tested
template<class F>
pi frac_bisect(F func){
	pi lw(0,1),up(1,0);
	int f;
	auto load=[&](pi v){
		f=func(v);
		assert(inc(-1,f,1));
	};
	load(lw);
	assert(f<=0);
	if(f==0)return lw;
	auto mid=[&](int a,int b){
		return pi(lw.a*a+up.a*b,lw.b*a+up.b*b);
	};
	load(mid(1,1));
	while(1){
		//func(lw)==-1
		//func(up)==1
		if(f==0)return mid(1,1);
		else if(f==-1){
			int w=1;
			while(1){
				w*=2;
				load(mid(1,w));
				if(f>-1)break;
			}
			int l=w/2,r=w,rf=f;
			while(r-l>1){
				const int v=(l+r)/2;
				load(mid(1,v));
				if(f==-1)l=v;
				else{
					r=v;
					rf=f;
				}
			}
			lw=mid(1,l);
			f=rf;
		}else if(f==1){
			int w=1;
			while(1){
				w*=2;
				load(mid(w,1));
				if(f<1)break;
			}
			int l=w/2,r=w,rf=f;
			while(r-l>1){
				const int v=(l+r)/2;
				load(mid(v,1));
				if(f==1)l=v;
				else{
					r=v;
					rf=f;
				}
			}
			up=mid(l,1);
			f=rf;
		}else assert(0);
	}
}

//有理数二分探索を並列化するためのライブラリ
//stress-tested
//EC Final 2021 K
struct Frac_Bisector{
	pi lw=pi(0,1),up=pi(1,0),ans;
	pi mid(int a,int b){
		return pi(lw.a*a+up.a*b,lw.b*a+up.b*b);
	}
	int phase=0,w,l,r,rf;
	//解がすでに求まっているかどうか返す
	//true: v に答えを入れる
	//false: v に次にクエリすべき有理数を入れる
	//phase=-1; すでに解は決定
	//phase 0;
	bool determined(pi&v){
		if(phase==-1){
			v=ans;
			return true;
		}else if(phase==0){
			//check if (0,1) is ok
			v=lw;
			return false;
		}else if(phase==1){
			//check mid(lw,up);
			v=mid(1,1);
			return false;
		}else if(phase==2){
			//f(mid(1,w))==-1
			//find w s.t. f(mid(1,w))>-1
			w*=2;
			v=mid(1,w);
			return false;
		}else if(phase==3){
			//f(mid(w,1))==1
			//find w s.t. f(mid(w,1))<1
			w*=2;
			v=mid(w,1);
			return false;
		}else if(phase==4){
			//f(mid(1,l))==-1
			//f(mid(1,r))>-1
			//find max t s.t f(mif(1,t))==-1
			//r の結果を保存して微小に高速化している
			if(r-l==1){
				if(rf==0){
					v=mid(1,r);
					return true;
				}else if(rf==1){
					lw=mid(1,l);
					w=2;
					v=mid(w,1);
					phase=3;
					return false;
				}else assert(false);
			}else{
				v=mid(1,(l+r)/2);
				return false;
			}
		}else if(phase==5){
			//f(mid(l,1))==1
			//f(mid(r,1))<1
			//find max t s.t f(mif(t,1))==1
			//r の結果を保存して微小に高速化している
			if(r-l==1){
				if(rf==0){
					v=mid(r,1);
					return true;
				}else if(rf==-1){
					up=mid(l,1);
					w=2;
					v=mid(1,w);
					phase=2;
					return false;
				}else assert(false);
			}else{
				v=mid((l+r)/2,1);
				return false;
			}
		}else{
			assert(false);
		}
	}
	void tell(int f){
		assert(phase!=-1);
		assert(inc(-1,f,1));
		if(phase==0){
			if(f==-1){
				phase=1;
			}else if(f==0){
				phase=-1;
				ans=lw;
			}else assert(false);
		}else if(phase==1){
			if(f==-1){
				phase=2;
				w=1;
			}else if(f==0){
				phase=-1;
				ans=mid(1,1);
			}else if(f==1){
				phase=3;
				w=1;
			}
		}else if(phase==2){
			if(f>-1){
				l=w/2;
				r=w;
				rf=f;
				phase=4;
			}
		}else if(phase==3){
			if(f<1){
				l=w/2;
				r=w;
				rf=f;
				phase=5;
			}
		}else if(phase==4){
			if(f==-1)l=(l+r)/2;
			else{
				r=(l+r)/2;
				rf=f;
			}
		}else if(phase==5){
			if(f==1)l=(l+r)/2;
			else{
				r=(l+r)/2;
				rf=f;
			}
		}else assert(false);
	}
};

void slv(){
	int n;cin>>n;
	vc<pi> ps(n);
	rep(i,n){
		ps[i]=pi(i,read());
	}
	vc<pi> psrev(n);
	rep(i,n)psrev[i]=-(ps[n-1-i]+pi(0,1));
	
	CHT_Query maxcht(ps);
	CHT_Query mincht(psrev);
	
	int q;cin>>q;
	vc<pi> lr(q);
	rep(i,q){
		int l,r;cin>>l>>r;
		l--;
		lr[i]=pi(l,r);
	}
	vc<pi> tilt(q);
	vc<Frac_Bisector> fb(q);
	vc<tuple<int,int,int>> ans(q);
	vc<pi> curlow(q,pi(-1,1));
	vc<pi> curhigh(q,pi(1,0));
	while(1){
		vi query_idx,known_idx;
		rep(i,q)if(!fb[i].determined(tilt[i])){
			auto [l,r]=lr[i];
			if(fcmp(curlow[i],tilt[i])<0&&fcmp(tilt[i],curhigh[i])<0){
				query_idx.pb(i);
				maxcht.add_query(l,r,-tilt[i].a,tilt[i].b);
				mincht.add_query(n-r,n-l,-tilt[i].a,tilt[i].b);
			}else{
				known_idx.pb(i);
			}
		}
		if(query_idx.empty()&&known_idx.empty())break;
		vc<pi> maxxy=maxcht.calc();
		vc<pi> minxy=mincht.calc();
		rep(ii,si(query_idx)){
			int i=query_idx[ii];
			pi lw=maxxy[ii],up=-minxy[ii];
			pi dir(-tilt[i].a,tilt[i].b);
			int lwval=dot(lw,dir);
			int upval=dot(up,dir);
			if(lwval<upval){
				auto [a,c]=tilt[i];
				ans[i]=mt(a,lwval,c);
				fb[i].tell(0);
			}else{
				if(lw.a<up.a){
					fb[i].tell(1);
					pi v=up-lw;
					swap(v.a,v.b);
					if(fcmp(v,curhigh[i])<0)curhigh[i]=v;
				}else{
					fb[i].tell(-1);
					pi v=lw-up;
					swap(v.a,v.b);
					if(fcmp(curlow[i],v)<0)curlow[i]=v;
				}
			}
		}
		for(auto i:known_idx){
			if(fcmp(tilt[i],curlow[i])<=0)
				fb[i].tell(-1);
			else if(fcmp(curhigh[i],tilt[i])<=0)
				fb[i].tell(1);
			else assert(false);
		}
	}
	rep(i,q){
		auto [l,r]=lr[i];
		auto [a,b,c]=ans[i];
		b+=a*l;
		print(a,b,c);
	}
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	if(0){//test CHT Query
		const int nqmax=10;
		const int vmax=10;
		const int tmax=10000;
		rng(n,1,nqmax+1){
			rng(qnum,1,nqmax+1){
				cerr<<"N "<<n<<" Q "<<qnum<<endl;
				rep(t,tmax){
					vc<pi> ps(n);
					rep(i,n){
						ps[i].a=rand_int(0,vmax);
						ps[i].b=rand_int(0,vmax);
					}
					soin(ps);
					CHT_Query cq(ps);
					vc<tuple<int,int,int,int>> qs(qnum);
					rep(i,qnum){
						int p=rand_int(-vmax,vmax);
						int q=rand_int(0,vmax);
						int l=rand_int(n);
						int r=rand_int(l+1,n);
						cq.add_query(l,r,p,q);
						qs[i]=mt(l,r,p,q);
					}
					vc<pi> best=cq.calc();
					rep(i,qnum){
						auto [l,r,p,q]=qs[i];
						int god=-inf;
						rng(j,l,r)chmax(god,dot(ps[j],pi(p,q)));
						int ans=dot(best[i],pi(p,q));
						if(god!=ans){
							cerr<<n<<" "<<qnum<<endl;
							cerr<<ps<<endl;
							cerr<<qs<<endl;
							cerr<<i<<" "<<god<<" "<<best[i]<<" "<<ans<<endl;
							/*cerr<<cq.z[1]<<endl;
							cerr<<cq.z[2]<<endl;
							cerr<<cq.z[3]<<endl;
							cerr<<ccw(pi(0,7),pi(0,8),pi(1,8))<<endl;*/
						}
						assert(god==ans);
					}
				}
			}
		}
		return 0;
	}
	
	if(0){//test frac_bisect
		const int vmax=100;
		const int tmax=10000000;
		auto getrandf=[&](){
			int num=rand_int(0,vmax);
			int den=rand_int(1,vmax);
			return pi(num,den);
		};
		int eval_cnt=0;
		rep(t,tmax){
			if(t%10000==0)cerr<<t<<endl;
			pi lw=getrandf();
			pi up=getrandf();
			if(fcmp(lw,up)>0)swap(lw,up);
			
			pi god(-1,-1);
			rng(den,1,vmax*2+1)rep(num,vmax*2+1){
				pi z(num,den);
				if(fcmp(lw,z)<=0&&fcmp(z,up)<=0){
					god=z;
					goto foundgod;
				}
			}
			foundgod:;
			assert(god!=pi(-1,-1));
			pi last;
			auto f=[&](pi v){
				eval_cnt++;
				if(fcmp(v,lw)<0)return -1;
				if(fcmp(up,v)<0)return 1;
				last=v;
				return 0;
			};
			//pi ans=frac_bisect(f);
			pi ans;
			Frac_Bisector fb;
			while(!fb.determined(ans))
				fb.tell(f(ans));
			ans=last;
			
			if(god!=ans){
				cerr<<lw<<" "<<up<<endl;
				cerr<<god<<" "<<ans<<endl;
			}
			assert(god==ans);
		}
		
		cerr<<"Eval Cnt "<<eval_cnt<<endl;
		return 0;
	}
	
	if(dbg){
		while(1)slv();
	}else{
		int t;cin>>t;rep(_,t)
		slv();
	}
}