#include <iostream>
#include <vector>

template <class T>
std::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }

template <int MOD>
struct ModInt {
    using lint = long long;
    int val;

    // constructor
    ModInt(lint v = 0) : val(v % MOD) {
        if (val < 0) val += MOD;
    };

    // unary operator
    ModInt operator+() const { return ModInt(val); }
    ModInt operator-() const { return ModInt(MOD - val); }
    ModInt inv() const { return this->pow(MOD - 2); }

    // arithmetic
    ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; }
    ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; }
    ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; }
    ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; }
    ModInt pow(lint n) const {
        auto x = ModInt(1);
        auto b = *this;
        while (n > 0) {
            if (n & 1) x *= b;
            n >>= 1;
            b *= b;
        }
        return x;
    }

    // compound assignment
    ModInt& operator+=(const ModInt& x) {
        if ((val += x.val) >= MOD) val -= MOD;
        return *this;
    }
    ModInt& operator-=(const ModInt& x) {
        if ((val -= x.val) < 0) val += MOD;
        return *this;
    }
    ModInt& operator*=(const ModInt& x) {
        val = lint(val) * x.val % MOD;
        return *this;
    }
    ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); }

    // compare
    bool operator==(const ModInt& b) const { return val == b.val; }
    bool operator!=(const ModInt& b) const { return val != b.val; }

    // I/O
    friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept { return is >> x.val; }
    friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; }
};

constexpr int MOD = 1e9 + 7;
using mint = ModInt<MOD>;

using lint = long long;

void solve() {
    lint ll, rr;
    std::cin >> ll >> rr;

    mint ans = 0;
    for (int k = 0; k < 60; ++k) {
        lint l = std::max(ll - (1LL << k), 0LL),
             r = std::min(rr - (1LL << k), (1LL << k) - 1);
        if (l > r) continue;

        auto dp = vec(2, vec(2, mint(1)));
        auto ndp = dp;
        for (int i = 0; i < 60; ++i) {
            int lb = l & 1,
                rb = r & 1;
            l >>= 1, r >>= 1;

            for (int x = 0; x <= 1; ++x) {
                for (int y = 0; y <= 1; ++y) {
                    ndp[x][y] = 0;
                }
            }

            for (int yb = 0; yb <= 1; ++yb) {
                for (int xb = 0; xb <= yb; ++xb) {
                    ndp[0][0] += dp[0][0];

                    if (lb <= xb) ndp[0][1] += dp[0][xb == lb];
                    if (yb <= rb) ndp[1][0] += dp[yb == rb][0];
                    if (lb <= xb && yb <= rb) {
                        ndp[1][1] += dp[xb == lb][yb == rb];
                    }
                }
            }

            std::swap(dp, ndp);
        }
        ans += dp[1][1];
    }
    std::cout << ans << std::endl;
}

int main() {
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}


Measured memory_bytes: 256