#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
typedef double db;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
template <typename Type>
using vec=vector<Type>;
template <typename Type>
using grheap=priority_queue<Type>;
template <typename Type>
using lrheap=priority_queue<Type,vector<Type>,greater<Type> >;
#define fir first
#define sec second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define chmax(a,b) a=max(a,b)
#define chmin(a,b) a=min(a,b)
#define rep(i,x,y) for(int i=x;i<=y;i++)
#define per(i,x,y) for(int i=x;i>=y;i--)

const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll mod=1e9+7;

const int T=64;

ll cft[T];

void init(ll rb){
    cft[0]=1;
    rep(i,1,inf){
        cft[i]=cft[i-1]*2;
        if((1ll<<i)>=rb)break;
    }
}

ll l,r;

ll f(ll x){
    ll res=0;
    while(x>1){
        if(x&1)x++;
        else x>>=1;
        res++;
    }
    return res;
}

ll getans(ll num){
    if(num<=1)return 0;
    if(num&1)return (getans(num-1)+f(num))%mod;
    return (((num/2+2*getans(num/2)%mod)%mod+num%mod)%mod-2+mod)%mod;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>l>>r;
    init(r);
    cout<<(getans(r)-getans(l-1)+mod)%mod;
    return 0;
}