#include <bits/stdc++.h>
//#include <atcoder/all>
//using namespace atcoder;
using namespace std;
const int INF = 1e9;
using ll = long long;
using inv = vector<int>;
using stv = vector<string>;
using pint = pair<int,int>;
#define FOR(i,l,r) for(int i=(l); i<(r); i++)
#define rep(i,r) for(int i=0; i<(r); i++)
#define repl(i,r) for(long long i=0; i<(r); i++)
#define FORl(i,l,r) for(long long i=(l); i<(r); i++)
#define INFL ((1LL<<62)-(1LL<<31))
#define pb(x) push_back(x)
#define CIN(x) cin >> x

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;
  rep(q,Q){
    
    ll x,f;
    cin >> x >> f;
    if(x % P == 0){
      cout << 0 << endl;
      continue;
    }

    ll res = M/P;

    ll p = (f*modinv(x,P))%P;

    if(p >= 1 &&M%P >= p) res++;
    //cout << "M%P" << M%P << " " << "p:" <<(f*modinv(x,P))%P << endl;
    cout << res << endl;

  }
  
}