Range AND

You are given positive integers $L$ and $R$. You have to find the sum $$S = \sum_{i=L}^R \left(L \wedge (L+1) \wedge \ldots \wedge i\right) \,,$$ where $\wedge$ denotes the bitwise AND operation. Since the sum could be large, compute it modulo $10^9+7$. ### Input - The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases f