Given two numbers a and b find all the number between the given range whose second least significant digit in the binary representation of the number is 1.

**Input:**

The line contains T i.e. number of test cases. The next T line contains two integers a and b each.

**Output:**

For each of the test case print the corresponding answer in separate lines.

**Constraints:**

1<= T <= 10^5

1 <= a<=b <=10^9

**Example:
Input**

1

1 4

2

**Explanation**

In the given range 2 (10) and 3 (11) are the numbers whose second least significant digit in its binary representation is 1.