/*
	Luogu name: Symbolize
	Luogu uid: 672793
*/
#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define x first
#define y second
#define rep1(i,l,r) for(register int i=l;i<=r;++i)
#define rep2(i,l,r) for(register int i=l;i>=r;--i)
#define rep3(i,x,y,z) for(register int i=x[y];~i;i=z[i])
#define rep4(i,x) for(auto i:x)
#define debug() puts("----------")
const int N=1e5+10;
const int inf=0x3f3f3f3f3f3f3f3f;
const int mod=1e9+7;
using namespace std;
int l,r; 
int read()
{
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		x=(x<<1)+(x<<3)+(ch^48);
		ch=getchar();
	}
	return f*x;
}
int get(int x)
{
	if(x<=1) return 0;
	int ans=0;
	while(x>1)
	{
		if(x&1) ++x;
		else x>>=1;
		++ans;
	}
	return ans;
}
int solve(int x)
{
	if(x<=1) return 0;
	int ans=((x/2-1+mod)%mod+(x/2*2%mod-1+mod)%mod+solve(x/2)*2%mod)%mod;
	if(x&1) ans=(ans+get(x))%mod;
	return ans;
}
signed main()
{
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	l=read();
	r=read();
	cout<<(solve(r)-solve(l-1)+mod)%mod<<"\n";
	return 0;
}
/*
3
*/