#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

template <long long mod>
struct modular {
    long long value;
    modular(long long x = 0) {
        value = x % mod;
        if (value < 0) value += mod;
    }
    modular& operator+=(modular other) {
        if ((value += other.value) >= mod) value -= mod;
        return *this;
    }
    modular& operator-=(modular other) {
        if ((value -= other.value) < 0) value += mod;
        return *this;
    }
    modular& operator*=(modular other) {
        value = value * other.value % mod;
        return *this;
    }
    modular& operator/=(modular other) {
        long long a = 0, b = 1, c = other.value, m = mod;
        while (c != 0) {
            long long t = m / c;
            m -= t * c;
            swap(c, m);
            a -= t * b;
            swap(a, b);
        }
        a %= mod;
        if (a < 0) a += mod;
        value = value * a % mod;
        return *this;
    }
    modular operator-() { return modular(-value); }
    modular operator+(modular rhs) { return modular(*this) += rhs; }
    modular operator-(modular rhs) { return modular(*this) -= rhs; }
    modular operator*(modular rhs) { return modular(*this) *= rhs; }
    modular operator/(modular rhs) { return modular(*this) /= rhs; }
    bool operator==(modular rhs) { return value == rhs.value; }
    bool operator!=(modular rhs) { return value != rhs.value; }
    bool operator<(modular rhs) { return value < rhs.value; }
};
template <long long mod>
string to_string(modular<mod> x) {
    return to_string(x.value);
}
template <long long mod>
ostream& operator<<(ostream& stream, modular<mod> x) {
    x.value %= mod;
    if (x.value < 0) x.value += mod;
    return stream << x.value;
}
template <long long mod>
istream& operator>>(istream& stream, modular<mod>& x) {
    stream >> x.value;
    x.value %= mod;
    if (x.value < 0) x.value += mod;
    return stream;
};
const long long mod = (long long)1e9 + 7;
using mint = modular<mod>;

inline mint pw(mint a, long long n) {
    mint res = 1;
    while (n > 0) {
        if (n & 1) {
            res *= a;
        }
        a *= a;
        n >>= 1;
    }
    return res;
}
vector<mint> fact, finv;
inline void cinit(int n) {
    fact.resize(n, 1);
    finv.resize(n, 1);
    for (int i = 2; i < n; i++) {
        fact[i] = fact[i - 1] * i;
    }
    finv[n - 1] /= fact[n - 1];
    for (int i = n - 2; i >= 2; i--) {
        finv[i] = finv[i + 1] * (i + 1);
    }
}
inline mint C(int n, int k) {
    if (n < k || k < 0 || n < 0) return 0;
    return fact[n] * finv[k] * finv[n - k];
}
inline mint H(int n, int k) {
    return C(n + k - 1, k);
}

map<tuple<int, ll, ll>, mint> mp;

mint solve(int d, ll l, ll r) {
    if (mp[make_tuple(d, l, r)] != 0) {
        return mp[make_tuple(d, l, r)];
    }
    ll s = 1LL << d, t = (1LL << (d + 1)) - 1;
    if (r < s || t < l) {
        return 0;
    }
    if (l <= s && t <= r) {
        return mp[make_tuple(d, l, r)] = pw(3, d);
    }
    r = min(r, t);
    l = max(l, s);
    ll mid = s + (1LL << (d - 1));
    ll dif = 1LL << (d - 1);
    if (r < mid) {
        return mp[make_tuple(d, l, r)] = solve(d - 1, l - dif, r - dif);
    }
    if (mid <= l) {
        return mp[make_tuple(d, l, r)] = solve(d - 1, l - s, r - s);
    }
    mint res = solve(d - 1, l - dif, r) + solve(d - 1, dif, r - s);
    ll a = l - dif, b = r - s;
    if (a <= b) {
        res += solve(d - 1, a, b);
    }
    return mp[make_tuple(d, l, r)] = res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll l, r;
    cin >> l >> r;
    mint ans;
    for (int d = 0; d < 61; d++) {
        ans += solve(d, l, r);
    }
    cout << ans << '\n';
    return 0;
}


Measured memory_bytes: 256