#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;

int ret(int a, int b) {
    if(a > b)
        return 0;

    int bit = 1;
    while(2 * bit <= b)
        bit *= 2;

    int mid = max(bit, a);
    int ans = ret(a, mid - 1);
    
    int len = b - mid + 1;
    ans += (1LL * len * (len + 1) / 2) % MOD;
    ans %= MOD;

    return ans;
}

int main() {
    int q; cin >> q;

    for(int i = 0; i < q; ++i) {
        int a, b; cin >> a >> b;
        cout << ret(a, b) << "\n";
    }
}