import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**19
# md = 998244353
md = 10**9+7

def extgcd(x, md):
    a, b = 1, 0
    while md:
        a, b = b, (a-x//md*b)
        x, md = md, x%md
    return a

def gcd(a, b):
    while b: a, b = b, a%b
    return a

# def extgcd(a, b, c):
#     if b == 0: return c//a, 0, abs(a)
#     x, y, g = extgcd(b, a%b, c)
#     return y, x-y*(a//b), g
#
def solve(a, b, s):
    g = gcd(a, b)
    if s%g: return 0
    a, b, s = a//g, b//g, s//g

    x = (s*extgcd(a, b))%b
    y = (s-a*x)//b
    # print(a, b, s, x, y, g)
    res = y//a+1
    if res < 0: return 0
    return res

mx = 1000005
for _ in range(II()):
    pp = LI()
    y = pp[-1]
    a, b, c = sorted(pp[:3])
    ans = 0
    for i in range(mx):
        if i*c > y: break
        ans += solve(a, b, y-i*c)
        ans %= md

    print(ans)