def ceildiv(a: int, b: int) -> int:
    return (a + b - 1) // b


def solve(n, m):
    r = ceildiv(n, 4)
    rem = 8 * r - n
    if rem >= m:
        return r

    return r + ceildiv(m - rem, 8)


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