// UUID: aa2149a3-4e15-4d97-8536-1de2f48c3cf7
#include <algorithm>
#include <bits/stdc++.h>
#include <cfloat>
#include <vector>
using namespace std;

void solve() {
    int n, p, q;
    cin >> n >> p >> q;

    vector<double> holes(n);
    vector<double> heights(n);

    for (int i = 0; i < n; i++) cin >> holes[i];
    for (int i = 0; i < n; i++) cin >> heights[i];

    for (int i = 0; i < q; i++) {
        int db;
        cin >> db;

        vector<pair<int, double>> g(db);
        for (int j = 0;j < db; j++){
            double sorsz, meret;
            cin >> sorsz >> meret;
            g[j] = {sorsz-1, meret};
        }

        double maxslope = -1e18;
        int res = 0;
        int po = 0;

        for (int j = 0; j < n; j++){
            double curr = heights[j];
            if (po < db && j == g[po].first) {
                curr+=g[po].second;
                po++;
            }
            double currslope = (double)(curr-p) / (double)holes[j];
            if (currslope > maxslope) {
                res++;
                maxslope = currslope;
            }
        }

        cout << res << ' ';
    }



    return;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}