#include <bits/stdc++.h> 
using namespace std;
const int N = 100010;
typedef long long ll;
ll n,m,q;
ll a[N],b[N];
map<pair<ll,pair<ll,ll> >,ll>p;
int main(){
	freopen("csp2022_game.in","r",stdin);
	freopen("csp2022_game.out","w",stdout);
    scanf("%lld%lld%lld",&n,&m,&q);
    for(int i = 1;i <= n;i++){
    	scanf("%lld",&a[i]);
	}
    for(int i = 1;i <= m;i++){
    	scanf("%lld",&b[i]);
	}
//    for(int i = 1;i <= n;i++){
//    	for(int j = 1;j <= m;j++){
//    		p[make_pair(i,make_pair(j,j))] = a[i] * b[j];
//		}
//	} 
	for(int i = 1;i <= q;i++){
		ll l1,r1,l2,r2,ans = -1e18;
		scanf("%lld%lld%lld%lld",&l1,&r1,&l2,&r2);
		for(int j = l1;j <= r1;j++){
			ll s = 1e18;
			for(int k = l2;k <= r2;k++){
				s = min(s,a[j]*b[k]);
			}
			ans = max(ans,s);
		}
		printf("%lld\n",ans);
	}
	
	return 0;
}