//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = 3.14159265359879323846264338327950288419;
const int INF = 2147483647;
using p = pair<int, int>;

long long modinv(long long a, long long m) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b;
        swap(a, b);
        u -= t * v;
        swap(u, v);
    }
    u %= m;
    if (u < 0) { u += m; }
    return u;
}

int main() {
    ll n, m, p, q;
    cin >> n >> m >> p >> q;
    vector<int> tori(p + 1);
    for (int i = 1; i <= m; i++) { tori[i % p]++; }
    for (int i = 0; i < tori.size(); i++) { cerr << i << " " << tori[i] << endl; }
    for (int i = 0; i < q; i++) {
        ll ans = 0;
        int x, f;
        cin >> x >> f;
        x %= p;
        ll inv = 0;
        if (f != 0) {
            inv = modinv(x, p) * f % p;
            //cerr << "inv = " << inv << endl;
            for (int i = 1; i * inv <= p; i++) {
                //cout << i*inv << " : " << tori[i * inv] << endl;
                ans += tori[i * inv];
            }
        } else {
            if (x % p == 0) { ans += tori[1]; }
            for (int i = 2; i * p <= m; i++) { ans += tori[inv * i * p]; }
        }
        cout << tori[inv] << endl;
    }

    return 0;
}