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

#if __cplusplus < 202002L
template <class T> int ssize(const T& a){ return a.size(); }
#endif
template <class T1, class T2> istream& operator>> (istream& in, pair <T1, T2>& a){ in >> a.first >> a.second; return in; }
template <class T> istream& operator>> (istream& in, vector <T>& a){ for (auto &x: a){ in >> x; } return in; }
 
using ll = long long;
using ld = long double;

vector <ll> 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){
	auto n = ssize(A1), m = ssize(A2), q = ssize(L1);

	vector <ll> ans(q);

	if ((n <= 500 and m <= 500 and q <= 500) or q <= 20){
		for (auto iq = 0; iq < q; iq++){
			vector <pair <ll, int>> opt(n);

			auto dnc = [&](auto&& self, int l1, int r1, int l2, int r2)->void{
				auto m1 = (l1 + r1) >> 1;
				opt[m1] = {numeric_limits <ll>::min(), -1};
				for (auto j = l2; j <= r2; j++){
					opt[m1] = max(opt[m1], pair <ll, int>{ll(A1[m1] + A2[j]) * (B1[m1] + B2[j]), j});
				}
				auto m2 = opt[m1].second;
				if (l1 <= m1 - 1){
					self(self, l1, m1 - 1, m2, r2);
				}
				if (m1 + 1 <= r1){
					self(self, m1 + 1, r1, l2, m2);
				}
			};
			dnc(dnc, L1[iq], R1[iq], L2[iq], R2[iq]);

			ll tans = max_element(begin(opt), end(opt))->first;
			ans[iq] = tans;
		}
	}

	return ans;
}

#ifndef ONLINE_JUDGE
signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	if (fopen("KEK.inp", "r")){
		freopen("KEK.inp", "r", stdin);
		freopen("KEK.out", "w", stdout);
	}

	int n, m, q;
	cin >> n >> m >> q;
	vector <int> A1(n), B1(n), A2(m), B2(m), L1(q), R1(q), L2(q), R2(q);
	cin >> A1 >> B1 >> A2 >> B2;
	for (auto iq = 0; iq < q; iq++){
		cin >> L1[iq] >> R1[iq] >> L2[iq] >> R2[iq];
	}

	vector <ll> ans = build_teams(A1, B1, A2, B2, L1, R1, L2, R2);
	for (auto iq = 0; iq < q; iq++){
		cout << ans[iq] << "\n";
	}
}
#endif