#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;

vector<long long> build_teams(vector<int> a1, vector<int> b1, vector<int> a2, vector<int> b2,
vector<int> l1, vector<int> r1, vector<int> l2, vector<int> r2) {
  vector<long long> ans(l1.size());

  for(int i = 0; i < l1.size(); i++) {
    auto solve = [&] (auto self, int l, int r, int from, int to) {
      if (l > r) return;
      int mid = l + r >> 1;
      long long best = 0, opt = from;
//      cout << l << "  " << r << " " << from << " " << to << endl;
      for(int j = from; j <= to; j++) {
        long long cost = (a1[mid] + a2[j]) * (b1[mid] + b2[j]);
//        cout << best << " " << cost << endl;
        if (best < cost) {
          best = cost;
          opt = j;
        }
      }
      self(self, l, mid - 1, from, opt);
      self(self, mid + 1, r, opt, to);
//      cout << best << endl;
      ans[i] = max(ans[i], best);
    };
    solve(solve, l1[i], r1[i], l2[i], r2[i]);
//    cout << ans[i] << endl;
  }
  return ans;
}

#ifdef ngu
int main() {

  freopen ("task.inp", "r", stdin);
  freopen ("task.out", "w", stdout);

  vector<long long> ans = build_teams({2, 7, 8, 9, 10}, {10, 9, 8, 6, 1}, {1, 3, 5, 9}, {10, 8, 7, 5}, {0, 2, 1}, {4, 3, 1}, {1, 0, 0}, {3, 2, 0});

  for(auto &j : ans) cout << j << endl;
//  int n; cin >> n;
//
//  vector<int> a1(n), a2(n), b1(n), b2(n);
//
//  int q; cin >> q;

}
#endif // ngu