import sys
readline=sys.stdin.readline

def floor_sum(n: int, m: int, a: int, b: int) -> int:
    assert 0 <= n
    assert 1 <= m

    ans = 0

    if a >= m:
        ans += (n - 1) * n * (a // m) // 2
        a %= m

    if b >= m:
        ans += n * (b // m)
        b %= m

    y_max = (a * n + b) // m
    x_max = y_max * m - b

    if y_max == 0:
        return ans

    ans += (n - (x_max + a - 1) // a) * y_max
    ans += floor_sum(y_max, a, m, (a - x_max % a) % a)

    return ans

T=int(readline())
for t in range(T):
    N,D,M,S=map(int,readline().split())
    if 2**S-D*M:
        r=min(N+1,(D*2**S)//abs(2**S-D*M)+1)
    else:
        r=N+1
    ans=r-abs(floor_sum(r,D,1,0)-floor_sum(r,2**S,M,0))-1
    print(ans)