#include<bits/stdc++.h>
//ios::sync_with_stdio(false);
//cin.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll inf=1000000000000000000;
double pi=2*acos(0);
#define rep(i,m,n) for(int i=m;i<n;i++)
#define rrep(i,n,m) for(int i=n;i>=m;i--)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll lmax(ll a,ll b){
    if(a<b)return b;
    else return a;
}
ll lmin(ll a,ll b){
    if(a<b)return a;
    else return b;
}
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll gya[200010];
ll kai[200010];
ll beki(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k%2==1){
            ret*=now;
            ret%=mod;
        }
        now*=now;
        now%=mod;
        k/=2;
    }
    return ret;
}
ll gyaku(ll n){
    return beki(n,mod-2);
}
void nckinit(ll n){
    kai[0]=1;
    kai[1]=1;
    for(int i=2;i<=n;i++){
        kai[i]=kai[i-1]*i;
        kai[i]%=mod;
    }
    gya[n]=gyaku(kai[n]);
    for(int i=n-1;i>=1;i--){
        gya[i]=gya[i+1]*(i+1);
        gya[i]%=mod;
    }
    gya[0]=1;
}
ll nck(ll n,ll k){
    if(k<0)return 0;
    if(k==0||n==k)return 1;
    ll ret=kai[n];
    ret*=gya[n-k];
    ret%=mod;
    ret*=gya[k];
    ret%=mod;
    return ret;
}
ll npk(ll n,ll k){
    if(k<0)return 0;
    if(k==0)return 1;
    ll ret=kai[n];
    ret*=gya[n-k];
    ret%=mod;
    return ret;
}
int main(){
    
    ll l,r;cin>>l>>r;
    ll ans=0;
    ll e=1,f=1;
    ll cn=0,cn2=0;
    for(;;){
        if(e>=l){
            break;
        }
        e*=2;
        cn++;
        
    }
    for(;;){
        if(f>r){
            f/=2;
            cn2--;
            break;
        }
        f*=2;
        cn2++;
    }
    
    while(f<e){
        cn=0;
        cn2=0;
        l-=f;
        r-=f;
        e=1;
        f=1;
        for(;;){
            if(e>=l){
                break;
            }
            e*=2;
            cn++;
            
        }
        for(;;){
            if(f>r){
                f/=2;
                cn2--;
                break;
            }
            f*=2;
            cn2++;
        }
    }
    rep(i,cn,cn2){
        ans+=beki(3,i);
        ans%=mod;
    }//cout<<f<<" "<<e<<endl;
    //cout<<f;
    //cout<<f<<" "<<e<<endl;
    
    ll bai=1;
    ll now=f;
    for(;;){
        if(now==r+1)break;
        ll p=1;
        ll cnt=0;
        for(;;){
            if(p>r+1-now){
                p/=2;
                cnt--;
                break;
            }
            p*=2;
            cnt++;
        }
        ans+=bai*beki(3,cnt);
        ans%=mod;
        bai*=2;
        bai%=mod;
        now+=p;
        
    }
    bai=1;
    now=l;
    
    for(;;){
        if(now==e)break;
        ll p=1;
        ll cnt=0;
        for(;;){
            if(p>e-now){
                p/=2;
                cnt--;
                break;
            }
            p*=2;
            cnt++;
        }
        ans+=bai*beki(3,cnt);
        ans%=mod;
        bai*=2;
        bai%=mod;
        now+=p;
        
    }
    cout<<ans<<endl;
}


Measured memory_bytes: 256