完美退役

#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,m,q;
int numa[100005],numb[100005],nums[100005];
int c[5000][5000];
signed main(){
	// freopen("game.in","r",stdin);
	// freopen("game.out","w",stdout);
	scanf("%lld %lld %lld",&n,&m,&q);
	for(int a=1;a<=n;a++){
		scanf("%lld",&numa[a]);
	}
	for(int a=1;a<=m;a++){
		scanf("%lld",&numb[a]);
	}
	for(int a=1;a<=n;a++){
		int smallest=0x3f3f3f;
		for(int b=1;b<=m;b++){
			c[a][b]=numa[a]*numb[b];
			//smallest=min(smallest,numa[a]*numb[b]);
		}
		//nums[a]=smallest;
	}
	for(int a=1;a<=q;a++){
		int l1,r1,l2,r2;
		scanf("%lld %lld %lld %lld",&l1,&r1,&l2,&r2);
		int tmp=0x3f3f3f;
		int ans=-tmp;
		for(int a=l1;a<=r1;a++){
			tmp=0x3f3f3f;
			for(int b=l2;b<=r2;b++){
				tmp=min(c[a][b],tmp);
			}
			ans=max(ans,tmp);
		}
		printf("%lld\n",ans);
	}
	return 0;
}