#include<bits/stdc++.h>
# define int long long
# define ull unsigned long long
# define rep(i, j, k) for (int i = j; i <= k; ++i)
# define id(i, j, k) plc[i] + (j) * (n - i + 1) + k
# define mod 1000000007
# define l(id) tr[id].l
# define r(id) tr[id].r
# define len(id) tr[id].len
# define suma(id) tr[id].suma
# define sumb(id) tr[id].sumb
# define sumab(id) tr[id].sumab
# define his(id) tr[id].his
# define la(id) tr[id].la
# define lb(id) tr[id].lb
# define lh(id) tr[id].lh
# define lhab(id) tr[id].lhab
# define lha(id) tr[id].lha
# define lhb(id) tr[id].lhb
# define lh(id) tr[id].lh
using namespace std;

struct segment
{
	int l, r, id;
	ull len, suma, sumb, sumab, his, la, lb, lhab, lha, lhb, lh;
} tr[1000005];
struct query
{
	int l, r, id;
	bool operator<(const query &x)const{return l > x.l;}
} q[250005];
int T, n, m, a[250005], b[250005], stka[250005], stkb[250005], ra, rb;
ull ans[250005];
void build(int id, int l, int r)
{
	l(id) = l, r(id) = r, len(id) = r - l + 1; if (l == r) return;
	int mid = (l + r) / 2; build(2 * id, l, mid), build(2 * id + 1, mid + 1, r);
}
void merge(int id){suma(id) = suma(2 * id) + suma(2 * id + 1), sumb(id) = sumb(2 * id) + sumb(2 * id + 1), sumab(id) = sumab(2 * id) + sumab(2 * id + 1), his(id) = his(2 * id) + his(2 * id + 1);}
void brush(int id, ull a, ull b, ull hab, ull ha, ull hb, ull h)
{
	sumab(id) += suma(id) * b + sumb(id) * a + len(id) * a * b;
	suma(id) += a * len(id), sumb(id) += b * len(id);
	his(id) += hab * sumab(id) + ha * suma(id) + hb * sumb(id) + h * len(id);
	lh(id) += h - lha(id) * a - lhb(id) * b + lhab(id) * a * b, lha(id) += ha - lhab(id) * b, lhb(id) += hb - lhab(id) * a;
	la(id) += a, lb(id) += b, lhab(id) += hab;
}
void pushdown(int id){brush(2 * id, la(id), lb(id), lhab(id), lha(id), lhb(id), lh(id)), brush(2 * id + 1, la(id), lb(id), lhab(id), lha(id), lhb(id), lh(id)), la(id) = lb(id) = lhab(id) = lha(id) = lhb(id) = lh(id) = 0;}
void upd(int id, int l, int r, ull a, ull b, ull hab, ull ha, ull hb, ull h)
{
	if (l(id) > r || r(id) < l) return;
	if (l(id) >= l && r(id) <= r) {brush(id, a, b, hab, ha, hb, h); return;}
	pushdown(id); upd(2 * id, l, r, a, b, hab, ha, hb, h), upd(2 * id + 1, l, r, a, b, hab, ha, hb, h); merge(id);
}
ull query(int id, int l, int r)
{
	if (l(id) > r || r(id) < l) return 0;
	if (l(id) >= l && r(id) <= r) return his(id);
	pushdown(id); return query(2 * id, l, r) + query(2 * id + 1, l, r);
}
signed main()
{
	ios::sync_with_stdio(false); cin.tie(0), cout.tie(0);
	cin >> T >> n;
	rep(i, 1, n) cin >> a[i]; rep(i, 1, n) cin >> b[i];
	cin >> m;
	rep(i, 1, m) cin >> q[i].l >> q[i].r, q[i].id = i;
	sort(q + 1, q + m + 1);
	build(1, 1, n);
	stka[0] = stkb[0] = n + 1;
	int pos = 1;
	for (int i = n; i; --i)
	{
		upd(1, i, i, a[i], b[i], 0, 0, 0, 0);
		while (ra && a[stka[ra]] < a[i]) upd(1, stka[ra], stka[ra - 1] - 1, a[i] - a[stka[ra]], 0, 0, 0, 0, 0), --ra;
		while (rb && b[stkb[rb]] < b[i]) upd(1, stkb[rb], stkb[rb - 1] - 1, 0, b[i] - b[stkb[rb]], 0, 0, 0, 0), --rb;
		stka[++ra] = stkb[++rb] = i;
		upd(1, 1, n, 0, 0, 1, 0, 0, 0);
		while (pos <= m && q[pos].l == i) ans[q[pos].id] += query(1, q[pos].l, q[pos].r), ++pos;
	}
	rep(i, 1, m) cout << ans[i] << '\n';
	return 0;
}