#include <bits/stdc++.h>
#include <float.h>

using namespace std;

int N, P, Q;
vector<pair<int, int>> X;
vector<double> maxslopes;
int initCount = 1;
vector<bool> initVisible;

void maxUpTo(vector<double>& v) {
    double currentMax = v[0];
    for (double& i : v) {
        if (i > currentMax) initCount++;
        i = max(i, currentMax);
        initVisible.push_back(i != currentMax);
        currentMax = i;
    }
}

int reCount(vector<double>& slopes, vector<pair<int, double>>& changes) {
    int r = initCount;
    // cout << (int)(changes.size())-1 << endl;
    for (int i = 0; i < (int)(changes.size())-1; i++)
    {
        
        if (!initVisible[changes[i].first]) r++;
        // cout << "asdf" << endl;
        for (size_t k = changes[i].first+1; k < changes[i+1].first; k++)
        {
            if (slopes[k] > changes[i].second) break;
            r -= initVisible[k];
        }
    }
    pair<int, double> last = changes[changes.size()-1];
    if (!initVisible[last.first]) r++;
    for (size_t k = last.first+1; k < slopes.size(); k++)
    {
        if (slopes[k] > last.second) break;
        r -= initVisible[k];
    }
    return r;
}

int main() {
    cin.tie(0); ios::sync_with_stdio(0);
    cin >> N >> P >> Q;
    int x;
    vector<double> slopes;
    int a;
    for (size_t i = 0; i < N; i++)
    {
        cin >> a;
        X.push_back({a, 0});
    }
    // cout << "Initial slopes ";
    for (size_t i = 0; i < N; i++)
    {
        cin >> a;
        X[i].second = a;
        slopes.push_back( (double)( X[i].second - P ) / (X[i].first) );
        // cout << fixed << (double)( X[i].second - P ) / (X[i].first) << " ";
    }
    // cout << "\n";
    maxUpTo(slopes);
    for (size_t q = 0; q < Q; q++)
    {
        int Db; cin >> Db;
        int index, m;
        vector<pair<int, double>> changes;
        double currentMax = -DBL_MAX;
        for (size_t i = 0; i < Db; i++)
        {
            cin >> index >> m;
            index--;
            double newslope = ( (double)( X[index].second + m - P ) / (X[index].first) );
            if (newslope < slopes[index] || newslope < currentMax) continue;
            currentMax = max(currentMax, newslope);
            changes.push_back({index, newslope});
            // cout << "wrote " << fixed << newslope << " to " << index << " replacing " << fixed << slopes[index] << "\n";
        }
        if (changes.empty()) cout << initCount+1 << " ";
        else cout << reCount(slopes, changes) << " ";
    }
}