import sys
readline=sys.stdin.readline
import math

def Extended_Euclid(n,m):
    stack=[]
    while m:
        stack.append((n,m))
        n,m=m,n%m
    if n>=0:
        x,y=1,0
    else:
        x,y=-1,0
    for i in range(len(stack)-1,-1,-1):
        n,m=stack[i]
        x,y=y,x-(n//m)*y
    return x,y

T=int(readline())
for t in range(T):
    M,A,B,K=map(int,readline().split())
    if A<K:
        ans=0
    elif A==K:
        g=math.gcd(A,B)
        ans=M//A-1-(M//B-M//(A*B//g))
        if B%A:
            a=M-M%A
            b=M-M%B
            if b%A==0:
                b-=B
            if a<b:
                ans-=1
    else:
        X,Y=Extended_Euclid(A,B)
        g=math.gcd(A,B)
        a=A//g
        b=B//g
        ans=0
        for x,y in ((X,-Y),(-X,Y)):
            if K%g==0:
                x*=K//g
                y*=K//g
                l=max((1-x*A+b*A-1)//(b*A),(1-y*B+a*B-1)//(a*B))
                r=min((M-x*A)//(b*A),(M-y*B)//(a*B))+1
                ans+=max(r-l,0)
        #1<=(x+b*i)*A<=M
        #1<=(y+a*i)*B<=M

        #1+4i
        #0+1i
    print(ans)