//@formatter:off
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define rrep(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = int(s); i < int(n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vvd vector<vector<double>>
#define vs vector<string>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vp vector<P>
#define vvp vector<vector<P>>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?']':','); return os; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << '\n'; }
void YES(bool b) { cout << (b ? "YES" : "NO") << '\n'; }
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on

const int mod = 1000000007;

//const int mod = 998244353;
struct mint {
    ll x;
    
    mint(ll x = 0) : x((x % mod + mod) % mod) {}
    
    mint operator-() const { return mint(-x); }
    
    mint &operator+=(const mint &a) {
        if ((x += a.x) >= mod) x -= mod;
        return *this;
    }
    
    mint &operator++() { return *this += mint(1); }
    
    mint &operator-=(const mint &a) {
        if ((x += mod - a.x) >= mod) x -= mod;
        return *this;
    }
    
    mint &operator--() { return *this -= mint(1); }
    
    mint &operator*=(const mint &a) {
        (x *= a.x) %= mod;
        return *this;
    }
    
    mint operator+(const mint &a) const {
        mint res(*this);
        return res += a;
    }
    
    mint operator-(const mint &a) const {
        mint res(*this);
        return res -= a;
    }
    
    mint operator*(const mint &a) const {
        mint res(*this);
        return res *= a;
    }
    
    mint pow(ll t) const {
        mint res = mint(1), a(*this);
        while (t > 0) {
            if (t & 1) res *= a;
            t >>= 1;
            a *= a;
        }
        return res;
    }
    
    // for prime mod
    mint inv() const { return pow(mod - 2); }
    
    mint &operator/=(const mint &a) { return *this *= a.inv(); }
    
    mint operator/(const mint &a) const {
        mint res(*this);
        return res /= a;
    }
};

ostream &operator<<(ostream &os, const mint &m) { return os << m.x; }

mint dp[61][3][3][3];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    ll l, r;
    cin >> l >> r;
    dp[60][0][0][0] = 1;
    auto trans = [](int x, int y, int l, int r, int j, int k, int m) -> tuple<int, int, int> {
        if (y < x) return {2, 2, 2};
        int nj, nk, nm;
        if (j == 0) {
            if (x < l) nj = 2;
            else if (x == l) nj = 0;
            else nj = 1;
        } else nj = 1;
        if (k == 0) {
            if (y > r) nk = 2;
            else if (y == r) nk = 0;
            else nk = 1;
        } else nk = 1;
        if (m == 0) {
            if (x != y) nm = 2;
            else if (x == 0) nm = 0;
            else nm = 1;
        } else nm = 1;
        return {nj, nk, nm};
    };
    rrep(i, 60) {
        int nl = l >> i & 1, nr = r >> i & 1;
        rep(j, 2) rep(k, 2) rep(m, 2) {
                    rep(x, 2) rep(y, 2) {
                            auto[nj, nk, nm] = trans(x, y, nl, nr, j, k, m);
                            dp[i][nj][nk][nm] += dp[i + 1][j][k][m];
                        }
                }
    }
    mint ans = 0;
    rep(j, 2) rep(k, 2) rep(m, 2) ans += dp[0][j][k][m];
    cout << ans << endl;
}


Measured memory_bytes: 3612