def floor_sum(n, m, a, b):
    """
    return \\sum_{i=0}^{n-1} ((a*i+b)//m)
    """
    ret = 0
    while True:
        if a >= m:
            ret += (n - 1) * n // 2 * (a // m)
            a %= m
        if b >= m:
            ret += n * (b // m)
            b %= m
        y_max = (a * n + b) // m
        if y_max == 0:
            return ret
        x_max = y_max * m - b
        ret += (n - (x_max + a - 1) // a) * y_max
        n, m, a, b = y_max, a, m, -x_max % a


def solve(N, D, M, S):
    S = 1 << S
    if S == M * D:
        return N

    if S < M * D:
        th = -S * D // (S - M * D)
    else:
        th = S * D // (S - M * D)
    th = min(th, N)
    l = floor_sum(th, D, 1, 1)
    r = floor_sum(th, S, M, M)
    return th - abs(l - r)


for _ in range(int(input())):
    ans = solve(*map(int, input().split()))
    print(ans)