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

def num(a, b, s):
    g = gcd(a, b)
    if s%g:
        return 0
    if g > 1:
        return num(a//g, b//g, s//g)
    ini = s*pow(a, -1, b)%b
    return (s-a*ini)//(a*b)+1

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