#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int mx=1e5+5,maxlog=17;
const ll INF=1e18;
int n,m,q,l1,r1,l2,r2;
int Log2[mx];
struct st{
	ll val[mx][maxlog],fl;
	inline ll query(int l,int r,int op)
	{
		int t=Log2[r-l+1];
		if(fl&1)return min(val[l][t],val[r-(1<<t)+1][t]);
		else return max(val[l][t],val[r-(1<<t)+1][t]);
	}
	inline void init(int len){
		if(fl==2)for(int i=1;i<=len;++i){if(val[i][0]>=0)val[i][0]=-INF;}
		else if(fl==3)for(int i=1;i<=len;++i){if(val[i][0]<=0)val[i][0]=INF;}
		else if(fl==4)for(int i=1;i<=len;++i){val[i][0]=val[i][0]==0;}
		
		for(int gap=1;gap<=Log2[len];++gap){
			for(int i=1;i+(1<<gap)-1<=len;++i){
				if(fl&1)val[i][gap]=min(val[i][gap-1],val[i+(1<<(gap-1))][gap-1]);
				else val[i][gap]=max(val[i][gap-1],val[i+(1<<(gap-1))][gap-1]);	
			}
		}
	}
}a[5],b[5];//0_max 1_min 2_<0max 3_>0min 4_equalto0(max)
inline void ckmin(ll &a,ll b){if(a>b)a=b;}
inline void ckmax(ll &a,ll b){if(a<b)a=b;}
ll _a[5],_b[5],_t[5];
inline ll work()
{
	memset(_a,0,sizeof _a);memset(_b,0,sizeof _b);for(int i=0;i<=4;++i)_t[i]=INF;
	for(int i=0;i<=3;++i)_a[i]=a[i].query(l1,r1,i),_b[i]=b[i].query(l2,r2,i);
	if(a[4].query(l1,r1,4))_a[4]=0;else _a[4]=-INF;
	if(b[4].query(l2,r2,4))_b[4]=0;else _b[4]=-INF;
	
	//for(int i=0;i<=4;++i)printf("a[%d]=%lld,b[%d]=%lld\n",i,_a[i],i,_b[i]);
	
	for(int i=0;i<=4;++i){
		if(abs(_a[i])==INF)continue;
		for(int j=0;j<=4;++j)
			if(abs(_b[j])!=INF)
				ckmin(_t[i],_a[i]*_b[j]);
	}
	ll ans=-INF;
	for(int i=0;i<=4;++i)if(_t[i]<INF)ckmax(ans,_t[i]);
	//for(int i=0;i<=4;++i)printf("t[%d]=%lld\n",i,_t[i]);
	return ans;
}
int main()
{
	//freopen("game.in","r",stdin);freopen("game.out","w",stdout);
	for(int i=0;i<=4;++i)a[i].fl=i,b[i].fl=i;
	scanf("%d%d%d",&n,&m,&q);
	Log2[1]=0;for(int i=2;i<=max(n,m);++i)Log2[i]=Log2[i/2]+1;
	
	for(int i=1;i<=n;++i)scanf("%lld",&a[0].val[i][0]),a[1].val[i][0]=a[2].val[i][0]=a[3].val[i][0]=a[4].val[i][0]=a[0].val[i][0];
	for(int i=1;i<=m;++i)scanf("%lld",&b[0].val[i][0]),b[1].val[i][0]=b[2].val[i][0]=b[3].val[i][0]=b[4].val[i][0]=b[0].val[i][0];
	for(int i=0;i<=4;++i)a[i].init(n),b[i].init(m);
	
	while(q--){
		scanf("%d%d%d%d",&l1,&r1,&l2,&r2);
		printf("%lld\n",work());
	}
	return 0;
}