#include<iostream>
#include<climits>
#define N 100005

using namespace std;

int n, m, q;
int a[N], b[N];
int sum1[N], sum2[N];
struct tree{
	int maxn, minn;
}t1[N << 2], t2[N << 2];

void pushup(int now, int p){
	if (!p){
		t1[now].maxn = max(t1[now * 2].maxn, t1[now * 2 + 1].maxn);
		t1[now].minn = min(t1[now * 2].minn, t1[now * 2 + 1].minn);
	}else{
		t2[now].maxn = max(t2[now * 2].maxn, t2[now * 2 + 1].maxn);
		t2[now].minn = min(t2[now * 2].minn, t2[now * 2 + 1].minn);
	}
}

void build(int now, int l, int r, int p){
	if (l == r){
		if (!p){
			t1[now].maxn = t1[now].minn = a[l];
		}else{
			t2[now].maxn = t2[now].minn = b[l];
		}
		return;
	}
	int mid = (l + r) >> 1;
	build(now * 2, l, mid, p);
	build(now * 2 + 1, mid + 1, r, p);
	pushup(now, p);
}

int query1(int now, int l, int r, int x, int y, int p){
	if (x <= l && r <= y){
		if (!p){
			return t1[now].maxn;
		}else{
			return t2[now].maxn;
		}
	}
	int mid = (l + r) >> 1, ret = INT_MIN;
	if (x <= mid){
		ret = max(ret, query1(now * 2, l, mid, x, y, p));
	}
	if (mid + 1 <= y){
		ret = max(ret, query1(now * 2 + 1, mid + 1, r, x, y, p));
	}
	return ret;
}

int query2(int now, int l, int r, int x, int y, int p){
	if (x <= l && r <= y){
		if (!p){
			return t1[now].minn;
		}else{
			return t2[now].minn;
		}
	}
	int mid = (l + r) >> 1, ret = INT_MAX;
	if (x <= mid){
		ret = min(ret, query2(now * 2, l, mid, x, y, p));
	}
	if (mid + 1 <= y){
		ret = min(ret, query2(now * 2 + 1, mid + 1, r, x, y, p));
	}
	return ret;
}

long long get_ans(int ax, int ay, int bx, int by, int l1, int r1, int l2, int r2){
//	if (sum1[r1] - sum1[l1 - 1] == 0 && sum2[r2] - sum2[l2 - 1] == 0){
//		return 0;
//	}     <-这句话去掉就有55pts，否则就是0pts
	if (ax > 0 && ay > 0 && bx > 0 && by < 0){
		if (sum1[r1] - sum1[l1 - 1] == 0){
			return 1ll * ay * by;
		}else{
			return 0;
		}
	}
	if (ax > 0 && ay < 0 && bx > 0 && by < 0){
		if (sum1[r1] - sum1[l1 - 1] == 0){
			return max(1ll * ax * by, 1ll * ay * bx);
		}else{
			return 0;
		}
	}
	if (ax < 0 && ay < 0 && bx > 0 && by < 0){
		if (sum1[r1] - sum1[l1 - 1] == 0){
			return 1ll * ay * bx;
		}else{
			return 0;
		}
	}
	if (ax > 0 && ay > 0 && bx > 0 && by > 0){
		if (sum2[r2] - sum2[l2 - 1] == 0){
			return 1ll * ax * by;
		}else{
			return 0;
		}
	}
	if (ax > 0 && ay < 0 && bx > 0 && by > 0){
		if (sum2[r2] - sum2[l2 - 1] == 0){
			return 1ll * ax * by;
		}else{
			return 0;
		}
	}
	if (ax > 0 && ay < 0 && bx < 0 && by < 0){
		if (sum2[r2] - sum2[l2 - 1] == 0){
			return 1ll * ay * by;
		}else{
			return 0;
		}
	}
	if (ax < 0 && ay < 0 && bx < 0 && by < 0){
		if (sum2[r2] - sum2[l2 - 1] == 0){
			return 1ll * ax * by;
		}else{
			return 0;
		}
	}
	return 0;
}

int main(){
//	freopen("game.in", "r", stdin);
//	freopen("game.out", "w", stdout);
	cin >> n >> m >> q;
	for (int i = 1; i <= n; i++){
		cin >> a[i];
		sum1[i] = sum1[i] + (a[i] == 0);
	}
	for (int i = 1; i <= m; i++){
		cin >> b[i];
		sum2[i] = sum2[i] + (b[i] == 0);
	}
	build(1, 1, n, 0);
	build(1, 1, m, 1);
	for (int i = 1; i <= q; i++){
		int l1, r1, l2, r2;
		cin >> l1 >> r1 >> l2 >> r2;
		int ax, ay, bx, by;
		ax = query1(1, 1, n, l1, r1, 0), ay = query2(1, 1, n, l1, r1, 0);
		bx = query1(1, 1, m, l2, r2, 1), by = query2(1, 1, m, l2, r2, 1);
		cout << get_ans(ax, ay, bx, by, l1, r1, l2, r2) << endl;
	}
	return 0;
}