#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int mod(ll x){
	return (x%INF);
}
int calc(int l,int r){
	int dis=r-l+1;
	return mod(dis*1LL*(dis+1)/2LL);
}
int main(){
	#ifndef ONLINE_JUDGE
    freopen("file.in", "r", stdin);
	#endif	
	int q;
	scanf("%d",&q);
	while(q--){
		int x,y;
		scanf("%d%d",&x,&y);
		int xx=log2(x);
		int yy=log2(y);
		int ans=0;
		for(int i=xx;i<=yy;i++)
			if(xx<(1<<(i+1)) or yy>=1<<i)
				ans=mod(ans+calc(max(x,1<<i),min(y,(1<<(i+1))-1)));
		printf("%d\n",ans);		
	}
	return 0;
}