# oj t -c "python3 main.py"
import sys,math
from collections import defaultdict,deque
from itertools import combinations,permutations,accumulate,product
from bisect import bisect_left,bisect_right
from heapq import heappop,heappush,heapify
#from more_itertools import distinct_permutations,distinct_combinations
#from sortedcontainers import SortedList,SortedSet
def input():return sys.stdin.readline().rstrip()
def ii(): return int(input())
def ms(): return map(int, input().split())
def li(): return list(map(int,input().split()))
inf = pow(10,18)
mod = 998244353
#/////////////////////////////////
# 切り上げ除算
def celiDiv(p : int, q : int) -> int:
  return (p + q -1) // q
inf = pow(10,9)
def solve():
  N,M = ms()
  def megru_bisect(ng,ok):
    def judge(mid):
      return celiDiv(N,4)<=mid and celiDiv(N+M,8)<=mid
    while abs(ok-ng)>1:
      mid = (ok+ng)//2
      if judge(mid): # 条件を満たすなら
        ok = mid
      else:
        ng = mid
  
    return ng,ok
  print(megru_bisect(0,inf)[1])
T = ii()
for _ in range(T): solve()