#include <bits/stdc++.h>
using namespace std;
#include <atcoder/math>
using namespace atcoder;

int main() {
	int N, M, P, Q;
	cin >> N >> M >> P >> Q;
	for( int i = 0; i < Q; i++ ) {
		long long x, f;
		cin >> x >> f;
		if( x % P == 0 ) {
			int ans = 0;
			if( f == 0 ) ans = M;
			cout << ans << endl;
		}
		else {
			long long ix = inv_mod( x, P );
			long long y = f * ix % P;
			int ans = (M - y) / P;
			if( y ) ans++;
			if( y > M ) ans = 0;
			cout << ans << endl;
		}
	}
}