#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = atcoder::modint;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, p, q; cin >> n >> m >> p >> q;
	mint::set_mod(p);
	while (q--) {
		int x, f; cin >> x >> f;
		x %= p;
		f %= p;
		if (0 == x) {
			if (0 == f)cout << m << endl;
			else cout << 0 << endl;
		}
		else {
			auto inv = inv_mod(x, p);
			inv *= f;
			inv %= p;
			auto val = m + (p - inv);
			val /= p;
			if (0 == inv)val--;
			cout << val << endl;
		}
	}
	return 0;
}