#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cout << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
#define int long long

template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr istream& operator >> (istream &is, Fp<MOD>& x) noexcept {
        return is >> x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};
const int MOD = 1000000007;
using mint = Fp<MOD>;

int fa(int rbit, int a, int ybit) {
    if(rbit == 1) {
        if(a == 1 || ybit == 0) return 1;
        else return 0;
    } else {
        if(a == 1) return 1;
        else if(ybit == 0) return 0;
        else return 2;
    }
}

int fb(int lbit, int b, int xbit) {
    if(lbit == 1) {
        if(b == 1) return 1;
        else if(xbit == 1) return 0;
        else return 2;
    } else {
        if(b == 1 || xbit == 1) return 1;
        else return 0;
    }
}

ll l, r; 
mint dp[65][3][3][2];

void solve() {
	cin >> l >> r;
    rep(i, 65) {
        rep(j, 3) {
            rep(k, 3) {
                rep(m, 2) {
                    dp[i][j][k][m] = 0;
                }
            }
        }
    }
    dp[61][0][0][0] = 1;
    for(int i = 61; i > 0; --i) {
        rep(j, 2) {
            rep(k, 2) {
                rep(m, 2) {
                    int rbit = (r >> (i - 1)) & 1LL, lbit = (l >> (i - 1)) & 1LL;
                    //cout << rbit << " " << lbit << endl;
                    mint s = dp[i][j][k][m];
                    dp[i - 1][fa(rbit, j, 1)][fb(lbit, k, 1)][1] += s;
                    dp[i - 1][fa(rbit, j, 0)][fb(lbit, k, 0)][m] += s;
                    if(m == 1) dp[i - 1][fa(rbit, j, 1)][fb(lbit, k, 0)][m] += s;
                }
            }
        }
    }
    mint ans = 0;
    rep(j, 2) {
        rep(k, 2) {
            rep(m, 2) {
                ans += dp[0][j][k][m];
                //per(i, 5) cout << i << " " << j << " " << k << " " << m << " ", debug(dp[0][j][k][m]);
            }
        }
    }
    cout << ans << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init();
	solve();
	//cout << "finish" << endl;
    return 0;
}

Measured memory_bytes: 256