#yuki-1358
from math import gcd
mod = 10**9+7
T = int(input())  #20以下

#testcases
for _ in range(T):
    N, K, H, Y = map(int, input().split())
    g = gcd(K, H)
    h = gcd(N, g)
    if Y%h:
        print(0)
    else:
        if h-1:
            N, K, H, Y, g = N//h, K//h, H//h, Y//h, g//h
        rev = pow(K//h,-1, H//h)
        ans, i = 0, 0
        if g-1:
            i = Y*pow(N, -1, g)%g
        while N*i <= Y:
            ans += ((Y-i*N)//K-rev*(Y-i*N)%H)//H+1
            ans %= mod
            i += g
        print(ans)