n, m, p, q = map(int, input().split())
count = [0] * m

for i in range(1, n + 1):
    mod_val = (i % p)
    for j in range(1, m + 1):
        if (mod_val * (j % p)) % p == f:
            count[j-1] += 1

for _ in range(q):
    x, f = map(int, input().split())
    print(count[x-1])