全WA，求调，必回关

#include<bits/stdc++.h>
using namespace std;
const int MAXN=100100,INF=1e9;
int n,m,q,a[MAXN],b[MAXN],maxx[MAXN][30],minn[MAXN][30],_maxx[MAXN][30],_minn[MAXN][30],_2log[MAXN];
int main()
{
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>n>>m>>q;
	_2log[1]=0;
	for(int i=2;i<MAXN;i++)_2log[i]=_2log[i/2]+1;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=m;i++)cin>>b[i];
	for(int i=1;i<=m;i++)
	{
		maxx[i][0]=b[i];
		minn[i][0]=b[i];
	}
	for(int i=1;i<=n;i++)
	{
		if(a[i]>=0)
		{
			_minn[i][0]=a[i];
			_maxx[i][0]=-INF;
		}
		else
		{
			_maxx[i][0]=a[i];
			_minn[i][0]=INF;
		}
	}
	for(int j=1;(1<<(j-1))<m;j++)
	{
		for(int i=1;i+(1<<j)-1<=m;i++)
		{
			maxx[i][j]=max(maxx[i][j-1],maxx[i+(1<<(j-1))][j-1]);
			minn[i][j]=min(minn[i][j-1],minn[i+(1<<(j-1))][j-1]);
		}
	}
	for(int j=1;(1<<(j-1))<n;j++)
	{
		for(int i=1;i+(1<<(j))-1<=n;i++)
		{
			_maxx[i][j]=max(_maxx[i][j-1],_maxx[i+(1<<(j-1))][j-1]);
			_minn[i][j]=min(_minn[i][j-1],_minn[i+(1<<(j-1))][j-1]);
		}
	}
	for(int i=1;i<=q;i++)
	{
		int l1,r1,l2,r2;
		cin>>l1>>r1>>l2>>r2;
		int bi,sm,l,q;
		l=r1-l1;
		q=r2-l2;
		bi=max(_maxx[l1][_2log[l+1]],_maxx[r1-(1<<(_2log[l]))+1][_2log[l]]);
		sm=min(_minn[l1][_2log[l+1]],_minn[r1-(1<<(_2log[l]))+1][_2log[l]]);
		cout<<max(bi*max(maxx[l2][_2log[q+1]],maxx[r2-(1<<(_2log[q]))+1][_2log[q]]),sm*min(minn[l2][_2log[q+1]],minn[r2-(1<<(_2log[q]))+1][_2log[q]])) <<endl;
	}
	return 0;
}