import sys

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

T = int(input())

def solve(n:int, m:int):

    hitsuyo_row = kiriage(n, 4)
    # hitsuyo_列に n人を埋める
    nokori = hitsuyo_row * 8 - n

    # m人がnokori席で足りるなら hitsuyo_row が答え
    if m <= nokori:
        return hitsuyo_row
    else:
        # m > nokori
        nokori_n = m - nokori
        return hitsuyo_row + kiriage(nokori_n, 8)

ansl = []
for i in range(T):
    N, M = map(int, sys.stdin.readline().rstrip().split())
    ans = solve(N, M)
    ansl.append(ans)

print(*ansl, sep='\n')