Let's denote **pop_count(x)** as the number of bits set ('1' bits) in the binary representation of the non-negative integer ***x***. You are given a query consisting of pair of integers l and r. Find the x, such that l ≤ x ≤ r, and **pop_count(x)** is maximum possible. ***Note : If there are multiple such numbers find the smallest of them.***