def solve():
	R, C = map(int, input().split())
	C -= 1
	b = R.bit_length()-1
	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(max(u - C, t - R) + t - 1)
for _ in range(int(input())):
	solve()