from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations
from functools import cmp_to_key, cache
from heapq import heappop, heappush
import math, sys
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10**7)
_int = lambda x: int(x)-1
MOD = 998244353
INF = 1<<62
Yes, No = "Yes", "No"

T = int(input())
for _ in range(T):
    N, M = map(int, input().split())
    need = -(-N//4)
    if need*8 >= (N+M):
        print(need)
    else:
        print(-(-(N+M)//8))