#include<bits/stdc++.h>
#define reg register
#define int long long
inline bool cmax(reg int &x,reg int y){return x<y?x=y,1:0;}
inline int max(reg int x,reg int y){return x>y?x:y;}
const int N=1e5+10,B=300;
int n,m,q,now_max,A[N],bel1[N],bel2[N];
std::pair<int,int> p1[N],p2[N];
int p1L[N],p1R[N],p2L[N],p2R[N],st[20][N];
inline int cost(reg std::pair<int,int> A,reg std::pair<int,int> B){auto [a,b]=A; auto [c,d]=B; return (a+c)*(b+d);}
void dc(reg int l,reg int r,reg int L,reg int R){
	if (l>r||L>R) return; reg int mid=l+r>>1,p=L,mx=cost(p2[L],p1[mid]);
	for (reg int i=L;i<=R;i++) if (cmax(mx,cost(p2[i],p1[mid]))) p=i;
	cmax(now_max,mx),st[0][mid]=mx; dc(l,mid-1,p,R),dc(mid+1,r,L,p);
}
inline int query(reg int l,reg int r){reg int L=std::__lg(r-l+1); return max(st[L][l],st[L][r-(1<<L)+1]);}
#undef int 
std::vector<long long> build_teams(std::vector<int> A1, std::vector<int> B1, std::vector<int> A2, std::vector<int> B2, std::vector<int> L1, std::vector<int> R1, std::vector<int> L2, std::vector<int> R2) {
	#define int long long
	n=A1.size(),m=A2.size(),q=L1.size();
	std::vector<int> ans(q);
	for (reg int i=0;i<=q;i++) L1[i]++,R1[i]++,L2[i]++,R2[i]++;
	for (reg int i=1;i<=n;i++) bel1[i]=(i-1)/B+1,p1R[bel1[i]]=i;
	for (reg int i=n;i;i--) p1L[bel1[i]]=i;
	for (reg int i=1;i<=m;i++) bel2[i]=(i-1)/B+1,p2R[bel2[i]]=i;
	for (reg int i=m;i;i--) p2L[bel2[i]]=i;
	for (reg int i=0;i<q;i++){
		reg int m1=0,m2=0;
		if (bel1[L1[i]]==bel1[R1[i]]) for (reg int j=L1[i];j<=R1[i];j++) p1[++m1]={A1[j-1],B1[j-1]};
		else{
			for (reg int j=L1[i];j<=p1R[bel1[L1[i]]];j++) p1[++m1]={A1[j-1],B1[j-1]};
			for (reg int j=R1[i];j>=p1L[bel1[R1[i]]];j--) p1[++m1]={A1[j-1],B1[j-1]};
		}
		if (bel2[L2[i]]==bel2[R2[i]]) for (reg int j=L2[i];j<=R2[i];j++) p2[++m2]={A2[j-1],B2[j-1]};
		else{
			for (reg int j=L2[i];j<=p2R[bel2[L2[i]]];j++) p2[++m2]={A2[j-1],B2[j-1]};
			for (reg int j=R2[i];j>=p2L[bel2[R2[i]]];j--) p2[++m2]={A2[j-1],B2[j-1]};
		}
		now_max=0,dc(1,m1,1,m2),cmax(ans[i],now_max);
	}
	for (reg int i=1;i<=m;i++) p1[i]={A2[i-1],B2[i-1]};
	for (reg int i=1;i<=bel1[n];i++){
		reg int l=p1L[i],r=p1R[i];
		for (reg int j=l;j<=r;j++) p2[j-l+1]={A1[j-1],B1[j-1]};
		dc(1,m,1,r-l+1);
		for (reg int j=1;1<<j<=m;j++) for (reg int x=1;x+(1<<j)<=m;x++) 
			st[j][x]=max(st[j-1][x],st[j-1][x+(1<<j-1)]);
		for (reg int j=0;j<q;j++) if (L1[j]<=l&&r<=R1[j]) cmax(ans[j],query(L2[j],R2[j]));
	}
	for (reg int i=1;i<=n;i++) p1[i]={A1[i-1],B1[i-1]};
	for (reg int i=1;i<=bel2[m];i++){
		reg int l=p2L[i],r=p2R[i];
		for (reg int j=l;j<=r;j++) p2[j-l+1]={A2[j-1],B2[j-1]};
		dc(1,n,1,r-l+1);
		for (reg int j=1;1<<j<=n;j++) for (reg int x=1;x+(1<<j)<=n;x++) 
			st[j][x]=max(st[j-1][x],st[j-1][x+(1<<j-1)]);
		for (reg int j=0;j<q;j++) if (L2[j]<=l&&r<=R2[j]) cmax(ans[j],query(L1[j],R1[j]));
	}
	return ans;
}