def distance(h1, w1, h2, w2):
    return max(abs(h1-h2), abs(w1-w2))

for _ in range(int(input())):
    H, W = map(int, input().split())
    W -= 1

    h, w = 1, 0
    flag = False
    ans = 0
    for i in reversed(range(W, 60)):
        if 1<<i & H:
            if not flag:
                flag = True
        elif flag:
            nh = (H|1<<i)&~((1<<i)-1)
            nw = i
            ans += distance(h, w, nh, nw)
            h, w = nh, nw
    ans += distance(h, w, H, W)

    print(ans)