def ceil_div(a, b):
    return (a + b - 1) // b


def solve():
    N, M = map(int, input().split())

    if N >= M:
        print(ceil_div(N, 4))
        return

    ans = 0
    ans += ceil_div(N, 4)
    M -= ceil_div(N, 4) * 4 + (-N % 4)

    if M > 0:
        ans += ceil_div(M, 8)

    print(ans)


T = int(input())

for _ in range(T):
    solve()