#include <iostream>
#include <array>
#include <algorithm>
#include <vector>
#include <bitset>
#include <set>
#include <unordered_set>
#include <cmath>
#include <complex>
#include <deque>
#include <iterator>
#include <numeric>
#include <map>
#include <unordered_map>
#include <queue>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <limits>
#include <iomanip>
#include <functional>
#include <cassert>
using namespace std;

using ll=long long;
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
using vll = V<ll>;
using vvll = V<vll>;
#define rep(i, k, n) for (ll i=k; i<(ll)n; ++i)
#define REP(i, n) rep(i, 0, n)
#define ALL(v) v.begin(),v.end()
template < class T > inline bool chmax(T& a, T b) {if (a < b) { a=b; return true; } return false; }
template < class T > inline bool chmin(T& a, T b) {if (a > b) { a=b; return true; } return false; }
#define DEBUG_VLL(vec) REP(sz, vec.size()) std::cerr<<vec[sz]<<(sz==vec.size()-1?'\n':' ');

const long long MOD = 1000000007;
const long long HIGHINF = (long long)1e18;
const int INF = (int)1e9;

class ModInt {
public:
    long long x;
    constexpr ModInt(const long long x=0) : x((x+MOD)%MOD) {}
    constexpr ModInt& operator+=(const ModInt rhs) {
        x += rhs.x;
        if (x >= MOD) x -= MOD;
        return *this;
    }
    constexpr ModInt operator+(const ModInt rhs) const {
        return ModInt(*this) += rhs; 
    }
    constexpr ModInt& operator-=(const ModInt& rhs) {
        x -= rhs.x;
        if (x < 0) x += MOD;
        return *this;
    }
    constexpr ModInt operator-(const ModInt rhs) const {
        return ModInt(*this) -= rhs; 
    }
    constexpr ModInt& operator*=(const ModInt& rhs) {
        x = x * rhs.x % MOD;
        return *this;
    }
    constexpr ModInt operator*(const ModInt rhs) const {
        return ModInt(*this) *= rhs; 
    }
    constexpr ModInt& operator/=(const ModInt& rhs) {
        ModInt div = powmod(rhs, MOD - 2);
        (x *= div.x) %= MOD;
        return *this;
    }
    constexpr ModInt operator/(const ModInt rhs) const {
        return ModInt(*this) /= rhs;
    }
    constexpr ModInt powmod(ModInt m, long long p) {
        if (p == 0) return ModInt(1);
        ModInt tmp = powmod(m, p / 2);
        if (p & 1) return tmp * tmp * m;
        else return tmp * tmp;
    }
    constexpr ModInt& operator++() {
        x += 1;
        return *this;
    }
    constexpr ModInt operator++(int) {
        ModInt tmp(*this);
        operator++();
        return tmp;
    }
    constexpr ModInt& operator--() {
        x -= 1;
        return *this;
    }
    constexpr ModInt operator--(int) {
        ModInt tmp(*this);
        operator--();
        return tmp;
    }

    friend ostream& operator<<(ostream& os, const ModInt &rhs) {
        os << rhs.x;
        return os;
    }
    friend istream& operator>>(istream& is, ModInt& rhs) {
        is >> rhs.x;
        return is;
    }
};
bool operator==(const ModInt& lhs, const ModInt& rhs) {
    return lhs.x == rhs.x;
}
bool operator!=(const ModInt& lhs, const ModInt& rhs) {
    return !(lhs == rhs);
}
ModInt powmod(ModInt m, long long p) {
    if (p == 0) return ModInt(1);
    ModInt tmp = powmod(m, p / 2);
    if (p & 1) return tmp * tmp * m;
    else return tmp * tmp;
}
using modi = ModInt;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll l, r; cin >> l >> r;
    V< V< V< V<modi> > > > dp(61, V< V< V<modi> > >(2, V< V<modi> > (2, V<modi>(2, 0))));
    // dp[i][j][k][l]: i ビット目でLと同じかそれ以上(j=0: Lと同じ)でRと同じかそれ以下(k=0: Rと同じ)であって
    // MSB が同じになったか(l=1: すでに同じになった)どうか
    dp[60][0][0][0] = 1;
    for (int i = 59; i >= 0; i--) {
        int lbit = (l >> i) & 1, rbit = (r >> i) & 1;
        for (int j = 0; j < 2; j++) {
            for (int k = 0; k < 2; k++) {
                for (int a = 0; a < 2; a++) {
                    for (int x = 0; x < 2; x++) for (int y = 0; y < 2; y++) {
                        if (x == 1 && y == 0) continue;
                        int nj = j, nk = k, na = a;
                        // L より小さい
                        if (j == 0 && x == 0 && lbit == 1) continue;
                        if (x == 1 && lbit == 0) nj = 1; // 大きくなる
                        // R より大きい
                        if (k == 0 && y == 1 && rbit == 0) continue;
                        if (y == 0 && rbit == 1) nk = 1; // 小さくなる
                        if (a == 0 && x != y) continue;
                        if (x == 1 && y == 1) na = 1;
                        dp[i][nj][nk][na] += dp[i + 1][j][k][a];
                    }
                }
            }
        }
    }

    modi ans = 0;
    for (int j = 0; j < 2; j++) {
        for (int k = 0; k < 2; k++) {
            for (int a = 0; a < 2; a++) ans += dp[0][j][k][a];
        }
    }
    cout << ans << '\n';
    return 0;
}


Measured memory_bytes: 3640