CF484A Bits
Description
Let's denote as  the number of bits set ('1' bits) in the binary representation of the non-negative integer $ x $ .
You are given multiple queries consisting of pairs of integers $ l $ and $ r $ . For each query, find the $ x $ , such that $ l
Input Format
Let's denote as  the number of bits set ('1' bits) in the binary representation of the non-negative integer $ x $ .
You are given multiple queries consisting of pairs of integers $ l $ and $ r $ . For each query, find the $ x $ , such that $ l
Output Format
For each query print the answer in a separate line.
Explanation/Hint
Let's denote as  the number of bits set ('1' bits) in the binary representation of the non-negative integer $ x $ .
You are given multiple queries consisting of pairs of integers $ l $ and $ r $ . For each query, find the $ x $ , such that $ l