The problem statement is simple, given A and B, find the sum of maximum odd divisor of the numbers between A and B (inclusive).

INPUT:
There are several test cases per file. Each file begins with T, number of test cases and the next T lines contain two values A and B.

CONSTRAINTS:
$1\leq T \leq 10^5$
$1\leq A \leq B \leq 10^{18}$

For the 1st file, $T\leq 100, B\leq 10^5$.
For the 2nd file, $T\leq 10^5, B\leq 10^5$.
For the 3rd file, $T\leq 10^5, B\leq 10^9$.
For the 4th file, $T\leq 10^5, B\leq 10^{18}$.

OUTPUT:
For each test case, print the answer. Since the answer can be huge, print it modulo $10^9+7$.