#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 4000000000000000001


int main(){
	
	int N,M;
	cin>>N>>M;
	int P,Q;
	cin>>P>>Q;
	rep(i,Q){
		int x,y;
		cin>>x>>y;
		if(y==0){
			if(x%P==0){
				cout<<M<<endl;
			}
			else{
				cout<<M/P<<endl;
			}
		}
		else{
			if(x%P==0){
				if(y==0){
				cout<<M<<endl;
				continue;
				}
				else{
					cout<<0<<endl;
					continue;
				}
			}
			long long t = y;
			t *= inv_mod(x,P);
			t %= P;
		//	cout<<t<<endl;
			long long ans = M/P;
			if(M%P>=t)ans++;
			cout<<ans<<endl;
		}
	}
	
	return 0;
}