#include #include using ll = long long; #define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i) #define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i) #define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i) #define rreps(i, n) for (int i = ((int)(n)); i > 0; --i) #define rep2(i, s, n) for (int i = (s); i < (int)(n); ++i) #define repc2(i, s, n) for (int i = (s); i <= (int)(n); ++i) constexpr int inf = 2000'000'000; constexpr ll linf = 4000000000000000000ll; constexpr ll M7 = 1000000007ll; constexpr ll M09 = 1000000009ll; constexpr ll M9 = 998244353ll; #define all(v) begin(v), end(v) #define rall(v) rbegin(v), rend(v) using namespace std; using namespace atcoder; template inline ostream& operator<<(ostream& os, vector& v) { for (auto& e : v) os << e << " "; return os; } template std::ostream& operator<<(std::ostream& os, const std::pair& p) noexcept { return os << "(" << p.first << ", " << p.second << ")"; } #ifdef ONLINE_JUDGE #define debug(...) #else #define debug(...) cerr << "<" << #__VA_ARGS__ << ">: ", debug_out(__VA_ARGS__) template void debug_out(T t) { cerr << t << endl; } template void debug_out(T t, Args... args) { cerr << t << ", "; debug_out(args...); } #endif ll modinv(ll a, ll M) { ll b = M, u = 1, v = 0; while (b) { ll 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() { ios_base::sync_with_stdio(false); cin.tie(NULL); ll n, m, p, q; cin >> n >> m >> p >> q; rep(i, q) { ll x, f; cin >> x >> f; ll b = (f * modinv(x % p, p)) % p; if (b > m) { cout << 0 << "\n"; continue; } if (f == 0) { cout << m / p + (m % p == 0) << "\n"; continue; } cerr << b << endl; ll ans = (m - b) / p + 1; cout << ans << endl; } return 0; }