#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define rep(i,x,y) for(register int i=x;i<=y;i++)
#define rep1(i,x,y) for(register int i=x;i>=y;--i)
#define int __int128
#define fire signed
#define il inline
template<class T> il void print(T x) {
	if(x<0) printf("-"),x=-x;
	if (x > 9) print(x / 10);
	putchar(x % 10 + '0');
}
template<class T> il void in(T &x) {
    x = 0; char ch = getchar();
    int f = 1;
    while (ch < '0' || ch > '9') {if(ch=='-') f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar(); }
    x *= f;
}
int T=1;
int l,r;
const int mod=1e9+7;
int qmi(int x,int y) {
	if(y<0) return false;
	int res=1;
	while(y) {
		if(y&1) res=res*x%mod;
		x=x*x%mod;
		y>>=1;
	}return res;
}
int f[100];
int jump(int x,int k) {
	while(k) {
		x=(x+1)/2;
		k--;
	}return x;
}
int get(int x) {
	int res=0;
	while(x!=1) {
		if(x&1) x++,res++;
		else x/=2;
	}return res;
}
int sum(int x) {
	int res=0;
	rep(i,0,61) {
		int l=(1ll<<i-1)+1,r=(1ll<<i);
		res+=max((int)0,min(r,x)-l+1)*i%mod;
		res%=mod;
	}return res;
}
int calc(int x) {
	if(x==1) return false;
	int res=0,san=0,now1=0,now2=0;
	rep(j,0,61) {
		f[j]=f[j-1]*2+qmi(2,j-1);
		int l=(1ll<<j)+1,r=(1ll<<j+1);
		r=min(r,x);
		if((r!=x)||(1ll<<j+1)-1==x) res+=f[j];
		else san=r-l+1,now1=l,now2=r;
		if(r==x) break;
	}
	if(san) {
		rep1(j,61,0) {
			int len=(1ll<<j);
			if(len<=san) {
				int now=jump(now1,j);
				res+=(get(now)*len%mod+f[j])%mod;
				res%=mod;
				san-=len;
				now1+=len;
			}
		}
	}
	return res;
}
void solve() {
	in(l),in(r);
//	cout<<(long long)jump(5,2)<<endl;
//	cout<<calc(5)+sum(5)<<endl;
	cout<<(long long)(((calc(r)-calc(l-1)+sum(r)-sum(l-1))%mod+mod)%mod);
//	print();
//	cout<<<<endl;
}
fire main() {
	while(T--) {
		solve();
	}
	return false;
}
/*
13 13
*/