from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

# M = 7
# for n in range(1<<M):
#     li = ["."]*M
#     for i in range(M):
#         if n>>i&1: li[i] = "#"
#     print(*li, sep="")

T = int(input())
for _ in range(T):
    R, C = map(int, input().split())
    B = list(bin(R)[2:])
    M = len(B)
    target = R
    x = 1<<(M-1)
    num = 0
    for i in range(M-C):
        num += x
        x >>= 1
        if B[i] == "0":
            target = num
            si = i
            break
    # print(R, bin(R)[2:])
    # print(target, bin(target)[2:])
    if R == target:
        print(R-1)
    else:
        # print(M-i-C, target-R)
        res = 0
        B = B[::-1]
        num = (R&((1<<C)-1))-(1<<(C-1))
        lst = C-1
        for i in range(C-1, M-si):
            if B[i] == "0":
                diff = (1<<i)-num
                # print(diff, i-lst, i, lst)
                res += max(diff, i-lst)
                num = 1<<i
                lst = i
            else:
                num |= 1<<i

        # print(target-R, res)
        # print(target-1 + max(M-si-C, target-R))
        # print("res=", res)
        print(target-1 + res)