#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T>& V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> >& Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T>& mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }
template<typename T>vector<T> make_v(size_t a){return vector<T>(a);}
template<typename T,typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

void test(){
    // https://oeis.org/A193494
    for(ll R = 1; R <= 100; R++){
        ll cnt = 0;
        for(ll x = 1; x <= R; x++){
            for(ll y = x; y <= R; y++){
                if((y%x) == (y^x)){
                    cout << bitset<5>(y) << " " << bitset<5>(x) << " " << (y%x) << " " << bitset<5>(y^x) << endl;
                    cnt++;
                }
            }
        }
        // cout << R << " : " << cnt << endl;
    }
}
void test2(){
    // https://oeis.org/A048896
    ll T = 0;
    for(ll y = 1; y < 64; y++){
        ll cnt = 0;
        for(ll x = 1; x <= y; x++){
            if((y%x) == (y^x)){
                cout << bitset<8>(y) << " " << bitset<8>(x) << " " << (y%x) << " " << bitset<8>(y^x) << endl;
                cnt++;
            }
        }
        T += cnt;
        // cout << y << " : " << cnt << " " << T << endl;
    }
}


const ll MOD = 1e9+7;
template<class Type>
Type solve(Type res = Type()){
    ll L,R; cin >> L >> R;

    // bit , L <= x , y <= R , bit
    auto memo = make_v<ll>(60,2,2,2);
    fill_v(memo,-1);
    auto dfs = [&](auto self,int pos=59,int flag1=0,int flag2=0,int flag3=0) -> ll{
        if(pos == -1){
            return 1;
        }
        ll& ret = memo[pos][flag1][flag2][flag3];
        if(~ret){
            return ret;
        }
        ret = 0;

        if(flag1 || ((L>>pos)&1) == 0){
            ret += self(self,pos-1,flag1,((R>>pos)&1) || flag2,flag3);
        }
        if((flag1 || ((L>>pos)&1) == 0) && (flag2 || ((R>>pos)&1) == 1) && flag3){
            ret += self(self,pos-1,flag1,flag2,flag3);
        }
        if(flag2 || ((R>>pos)&1) == 1){
            ret += self(self,pos-1,(((L>>pos)&1) == 0) || flag1,flag2,1);
        }
        ret %= MOD;

        return ret;
    };
    res = dfs(dfs);
    return res;
}
int main(void) {
    cin.tie(0); ios::sync_with_stdio(false);
    // test(); return 0;
    // test2(); return 0;
    
    //solve<ll>(0);
    cout << fixed << setprecision(12) << solve<ll>() << endl;
    return 0;
}

Measured memory_bytes: 3716