#include <iostream>
#include <string>
#include <cmath>
#include <vector>
using ll = long long;

int main() {
    ll N, M, P, Q;
    std::cin >> N >> M >> P >> Q;

    std::vector<ll> modP(M + 1);  // j%P の結果を保持する配列
    for (ll j = 1; j <= M; j++) {
        modP[j] = j % P;
    }

    for (ll i = 0; i < Q; i++) {
        ll x, f;
        std::cin >> x >> f;
        ll ans = 0;

        ll modX = x % P;  // x%P の結果を保持

        for (ll j = 1; j <= M; j++) {
            if ((modP[j] * modX) % P == f) {
                ans++;
            }
        }

        std::cout << ans << std::endl;
    }

    return 0;
}