def calc(r, c):
    for i in range(c + 1, r.bit_length()):
        if (r >> i) & 1 == 0:
            nr = r & ~((1 << i) - 1) | (1 << i)
            return calc(nr, i) + max(i - c, nr - r)
    else:
        return r - 1


def solve():
    R, C = map(int, input().split())
    print(calc(R, C - 1))


if __name__ == "__main__":
    T = int(input())
    for _ in range(T):
        solve()