#むずすぎる

def solve():
	R, C = map(int, input().split())
	C -= 1
	b = R.bit_length()
	u = -1
	for x in range(b-1, -1, -1):
		if (R>>x&1) == 0:
			u = x
			break
	if u < C:
		print(R-1)
		return
	l = 1 << u
	t = R // l + 1
	t *= l
	# print("t, u", t, u)
	q = 0
	for x in range(C, b):
		if (R>>x&1) == 0:
			q = x
			break
	q -= 1
	p = (R // (1<<q) + 1) * (1<<q) - 1
	# print("p, q", p, q)
	#(R, C) から (p, q) を経由して (t, u) へ
	cost = max(q - C, p - R) + max(t - p, u - q) + t - 1
	print(cost)
for _ in range(int(input())):
	solve()