Description
TWICE is a world-wise famous idol group.
One day, there is a special event for people with fans ID in the range [start, end].
Since you are a CS student, you want to check if there are any special relations between the numbers in this range.
The way you check these numbers is easy:
There will be T test cases.
For each test case, given the range [start, end], you must calculate the bitwise AND of all numbers in this range, inclusive.
For example, [5, 7] will be 5 & 6 & 7, which will be 101 & 110 & 111.
The calculated result is 4(100).
Note that for test case 1~3, there will be only 1 test case; for test case 4~5, there will be multiple test cases.
If you got TLE, please consider the bit relation in these numbers instead of using a brute-force algorithm.
Input
The first line is T(1 <= 50).
The next T lines are the test cases.
For each test case, are 2 unsigned integers start and end(1 <= start, end <=2147483647), separated by white space.
Output
For each test case, you have to print a '\n' in the end.