n, m, p, q = map(int, input().split())
xy = [[0] * m for _ in range(n)]
for i in range(n):
    for j in range(m):
        xy[i][j] = ((i + 1) * (j + 1)) % p

for _ in range(q):
    x, f = map(int, input().split())
    count = 0
    for j in range(m):
        if xy[x - 1][j] == f:
            count += 1
    print(count)