#include <iostream>
#include <vector>
using namespace std;
using ll = long long;

int n, p, q, k, mx = 0, sz = 0, ans;
vector <ll> x(2e5, 0);
vector <ll> y(2e5, 0);
vector <int> v(2e5, 0);
vector <int> inv(2e5, 0);
vector <int> a;
vector <int> b;

bool R(int i, int j) {
	return y[i] * x[j] < y[j] * x[i];
}

void bs(int x, int y) {
	int l = inv[x], r = (inv[y] == y ? inv[y] : inv[y] + 1), m;
	while (r - l > 1) {
		m = (r + l) / 2;
		(R(x, v[m]) ? r = m : l = m);
	}
	ans -= l - inv[x];
}

void solve() {
	cin >> k;
	a.resize(k);
	b.resize(k);
	for (int i = 0; i < k; i++) {
		cin >> a[i] >> b[i];
		y[a[i]] += b[i];
	}
	a.push_back(n + 1);
	ans = sz;
	for (int i = 0, j; i < k; i = j) {
		int x = a[i];
		if (R(v[inv[x]], x)) ans++;
		j = i + 1;
		while (!R(x, a[j])) j++;
		bs(x, a[j]);
	}
	for (int i = 0; i < k; i++) y[a[i]] -= b[i];
	cout << ans << " ";
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n >> p >> q;
	x[0] = 1; y[0] = -1e9;
	for (int i = 1; i <= n; i++) cin >> x[i];
	for (int i = 1; i <= n; i++) {
		cin >> y[i];
		y[i] -= p;
		if (R(mx, i)) { v[++sz] = i; mx = i; };
		inv[i] = sz;
	}
	x[n + 1] = 1; y[n + 1] = 1e9;
	v[sz + 1] = n + 1;
	inv[n + 1] = sz + 1;
	while (q--) solve();
}