/* author: kyawa */
#include<bits/stdc++.h>
using namespace std;

/*
 考察
 count(x * y % P) == f
 Pが素数なので周期はP
 
 */

int64_t mod(int64_t a, int64_t m) {
    int64_t res = a % m;
    if (res < 0) res += m;
    return res;
}

int64_t extGCD(int64_t a, int64_t b, int64_t &p, int64_t &q) {
    if (b == 0) { p = 1; q = 0; return a; }
    int64_t d = extGCD(b, a%b, q, p);
    q -= a/b * p;
    return d;
}

int64_t modinv(int64_t a, int64_t m) {
    int64_t x, y;
    extGCD(a, m, x, y);
    return mod(x, m);
}

int main(){
    int64_t N, M, P, Q; cin >> N >> M >> P >> Q;
    while(Q--){
        int64_t res = 0;
        int64_t x, f; cin >> x >> f;
        int64_t y = modinv(x, P) * f % P;
        if(M % P >= y) res++;
        //count(k >= 0, y + P * k < M)
        res += max(int64_t(0), M - y) / P;
        if(f == 0) res--;
        cout << res << '\n';
    }
}