#include <cstdio>
#include <algorithm>

using namespace std;

const int mod=(1e9)+7;

int solve(int x,int y)
{
    int a=30,b=30;
    for(;(x&(1<<a))==0;a--);
    for(;(y&(1<<b))==0;b--);
    int sol=0;
    for(int i=a;i<=b;i++)
    {
        int s1=max(1<<i,x),s2=min(((1<<(i+1))-1),y);
        sol=(sol+1LL*(s2-s1+1)*(s2-s1+2)/2)%mod;
    }
    return sol;
}

int main()
{
    //freopen("file.in", "r", stdin);
    //freopen("file.out", "w" ,stdout);
    int q,x,y;
    scanf("%d",&q);
    for(int i=1;i<=q;i++)
    {
        scanf("%d%d",&x,&y);
        printf("%d\n",solve(x,y));
    }
    return 0;
}