Description

Given two natural numbers $l,r$, you need to choose two integers $x,y$ that satisfy $l\le x\le y\le r$, and maximize $x|y$.

The operator $|$ represents bitwise-or operation.

Format

Input

The first line contains one integer $T(1\le T\le 10001)$ --- the number of test cases.

Each test case consists of one line containing two integers $l,r(0\le l \le r\le 10^{18})$.

Output

For each test case, print a single integer --- the maximum bitwise-or result $x|y$.

Samples

4
1 10
0 1
1023 1024
233 322

15
1
2047
511