A9758. Bits

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<=x<=r$ , and  is maximum possible. If there are multiple such numbers find the smallest of them.

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<=x<=r$ , and  is maximum possible. If there are multiple such numbers find the smallest of them.

For each query print the answer in a separate line.

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<=x<=r$ , and  is maximum possible. If there are multiple such numbers find the smallest of them.