#include <bits/stdc++.h>

using namespace std;

int N, P, Q;
vector<pair<int, int>> X;
vector<double> maxslopes;

void  getGood(vector<double>& v) {
    double cmax = v[0];
    maxslopes.push_back(cmax);
    for (size_t i = 1; i < v.size(); i++)
    {
        cmax = max(v[i], cmax);
        maxslopes.push_back(cmax);
    }
}

int doCrap(vector<double>& slope) {
    double maxslope = slope[0];
    int count = 1;
    for (size_t i = 1; i < slope.size(); i++)
    {
        if (slope[i] > maxslope) {
            count++;
            maxslope = slope[i];
        }
    }
    return count;
}

int main() {
    cin >> N >> P >> Q;
    int x;
    vector<double> slope;
    cout.precision(17);
    X.assign(N, {0, 0});
    for (size_t i = 0; i < N; i++)
    {
        cin >> x;
        X[i].first = x;
    }
    
    for (size_t i = 0; i < N; i++)
    {
        cin >> x;
        X[i].second = x;
        slope.push_back((double)((double)(x-P)/(double)X[i].first));
    }
    getGood(slope);
    vector<double> slope2 = slope;
    for (size_t q = 0; q < Q; q++)
    {
        int Db; cin >> Db;
        vector<pair<int, int>> kkckm;   
        int a, b;
        for (size_t i = 0; i < Db; i++)
        {
            cin >> a >> b;
            a--;
            double newslope = (double)((double)(X[a].second+b-P)/(double)X[a].first);
            if (newslope < maxslopes[a]) {
                continue;
            }
            kkckm.push_back({a, b});
            slope2[a] = newslope;
        }
        cout << doCrap(slope2) << ' ';
        for (pair<int, int>& x : kkckm)
        {
            slope2[x.first] = slope[x.first];
        }
        
    }
}