#include<bits/stdc++.h>
using ll = long long;
using namespace std;
#define pll pair <ll,ll>
#define fi first
#define se second
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1)
#define MASK(i) (1LL << (i))
#define MP make_pair
const ll bl = 340;
const ll MAXN = 1e5;
const ll MAXK = 17;
struct query{
    ll l1,r1,l2,r2,id;
};
ll q,n,m;
namespace{
    ll a1[MAXN+100],b1[MAXN+100],a2[MAXN+100],b2[MAXN+100];
    ll sp[MAXK][MAXN+100];
    void dnc(vector <ll> &id1,vector <ll> &id2,vector <ll> &res,ll l,ll r,ll optl,ll optr){
//        cout<<l<<' '<<r<<'\n';
        if (l > r)return;
        ll mid = (l + r) >> 1;
        res[mid] = 0;
        ll optmid = -1;
        for (ll j = optl;j <= optr;j ++){
            if ((a1[id1[mid]] + a2[id2[j]]) * (b2[id2[j]] + b1[id1[mid]]) > res[mid]){
                res[mid] = (a1[id1[mid]] + a2[id2[j]]) * (b2[id2[j]] + b1[id1[mid]]);
                optmid = j;
            }
        }
        dnc(id1,id2,res,l,mid-1,optmid,optr);
        dnc(id1,id2,res,mid+1,r,optl,optmid);
    }
}

std::vector<ll> 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) {
    q = sz(L1);
    n = sz(A1);
    m = sz(A2);
    for (ll i = 0;i < n;i ++){
        a1[i] = A1[i],b1[i] = B1[i];
    }
    for (ll i = 0;i < m;i ++){
        a2[i] = A2[i],b2[i] = B2[i];
    }
    vector <query> all(q);
    vector <ll> ans(q);
    for (ll i = 0;i < q;i ++){
        all[i] = {L1[i],R1[i],L2[i],R2[i],i};
    }
    for (ll T_T = 0;T_T < 2;T_T++){
        for (ll j = 0;j <= m/bl;j++){
            vector <ll> id1,id2,res;
            for (ll i = 0;i < n;i ++)id1.push_back(i);
            for (ll i = j*bl;i<=j*bl+bl-1 && i < m;i ++){
                id2.push_back(i);
            }
            res.resize(sz(id1));
            dnc(id1,id2,res,0,sz(id1)-1,0,sz(id2)-1);
            for (ll i =0 ;i < n;i ++)sp[0][i] =  res[i];
//            if (T_T==1){
//                for (ll i = 0;i < n;i ++)cout<<res[i]<<' ';
//                cout<<'\n';
//            }
            for (ll j1 = 1;j1 < MAXK;j1 ++){
                for (ll i = 0;i + MASK(j1)-1 < n;i ++){
                    sp[j1][i] = max(sp[j1-1][i],sp[j1-1][i+MASK(j1-1)]);
                }
            }
            ll L = j*bl,R = min(m-1,j*bl+bl-1);
//            cout<<"SUS "<<n<<' '<<m<<' '<<L<<' '<<R<<endl;
            for (auto x:all){
                if (x.l2 <= L && R <= x.r2){
//                    cout<<"BRUH"<<endl;
                    ll sz = __lg(x.r1 - x.l1 + 1);
                    ans[x.id] = max({ans[x.id],sp[sz][x.l1],sp[sz][x.r1-MASK(sz)+1]});
                }
            }
//            if (T_T==1){
//                for (ll i=  0;i < q;i ++){
//                    cout<<ans[i]<<' ';
//                }
//                cout<<'\n';
//            }
        }
        for (ll i = 0;i < q;i ++){
            swap(all[i].l1,all[i].l2);
             swap(all[i].r1,all[i].r2);
        }
        swap(A1,A2);
        swap(B1,B2);
        n = sz(A1);
        m = sz(A2);
        for (ll i = 0;i < n;i ++){
            a1[i] = A1[i],b1[i] = B1[i];
        }
        for (ll i = 0;i < m;i ++){
            a2[i] = A2[i],b2[i] = B2[i];
        }
    }
//    cout<<"SUS"<<endl;
    for (auto x:all){
        vector <ll> id1,id2,res;
        for (ll j = x.l1%bl,ptr = x.l1;j < bl && ptr <= x.r1;j ++,ptr++)id1.push_back(ptr);
        if (id1.back() != x.r1)for (ll j = x.r1%bl,ptr = x.r1;j >= 0 && ptr >= x.l1;j --,ptr--)id1.push_back(ptr);

        for (ll j = x.l2%bl,ptr = x.l2;j < bl && ptr <= x.r2;j ++,ptr++)id2.push_back(ptr);
        if (id2.back() !=  x.r2)for (ll j = x.r2%bl,ptr = x.r2;j >= 0 && ptr >= x.l2;j --,ptr--)id2.push_back(ptr);
        sort(id1.begin(),id1.end());
        sort(id2.begin(),id2.end());
//        for (auto x:id1)cout<<x<<' ';
//        cout<<'\n';
//        for (auto x:id2)cout<<x<<' ';
//        cout<<'\n';
        res.resize(sz(id1));
        dnc(id1,id2,res,0,sz(id1)-1,0,sz(id2)-1);
        for (auto y:res)ans[x.id] = max(ans[x.id],y);
    }
	return ans;
}