t = int(input())

def ceil(a, b):
    return (a+b-1)//b
    
for i in range(t):
    w, n, m = map(int,input().split())
    a = ceil(n, 4)
    b = (2 * w * a - n)
    c = ceil(m - b, 2 * w)
    ans = max(a, a + c)
    print(ans)