#include <bits/stdc++.h>

using namespace std;

typedef long long ll;


string bit(int n) {
    string s;
    if (n == 0) return "0";
    while (n) {
        if (n % 2) s += "1";
        else s += "0";
        n /= 2;
    }
    reverse(s.begin(), s.end());
    return s;
}

template<int M, bool IsPrime = false>
class Modulo {
    int n;

    static typename std::enable_if<IsPrime, ll>::type inv(ll a, ll p) {
        return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
    }

public:
    Modulo() : n(0) { ; }

    Modulo(int m) : n(m) {
        if (n >= M)
            n %= M;
        else if (n < 0)
            n = (n % M + M) % M;
    }

    Modulo(ll m) {
        if (m >= M)
            m %= M;
        else if (m < 0)
            m = (m % M + M) % M;
        n = m;
    }

    explicit operator int() const { return n; }

    explicit operator ll() const { return n; }

    bool operator==(const Modulo &a) const { return n == a.n; }

    Modulo &operator+=(const Modulo &a) {
        n += a.n;
        if (n >= M) n -= M;
        return *this;
    }

    Modulo &operator-=(const Modulo &a) {
        n -= a.n;
        if (n < 0) n += M;
        return *this;
    }

    Modulo &operator*=(const Modulo &a) {
        n = (ll(n) * a.n) % M;
        return *this;
    }

    Modulo operator+(const Modulo &a) const {
        Modulo res = *this;
        return res += a;
    }

    Modulo operator-(const Modulo &a) const {
        Modulo res = *this;
        return res -= a;
    }

    Modulo operator-() const { return Modulo(0) - *this; }

    Modulo operator*(const Modulo &a) const {
        Modulo res = *this;
        return res *= a;
    }

    Modulo operator^(ll m) const {
        if (m == 0) return Modulo(1);
        const Modulo a = *this;
        Modulo res = (a * a) ^(m / 2);
        return m % 2 ? res * a : res;
    }

    typename std::enable_if<IsPrime, Modulo>::type
    operator/(const Modulo &a) const {
        return *this * inv(ll(a), M);
    }

    typename std::enable_if<IsPrime, Modulo>::type operator/=(const Modulo &a) {
        return *this *= inv(ll(a), M);
    }

    friend bool is_zero(const Modulo &x) { return int(x) == 0; }

    friend int abs(const Modulo &x) { return int(x); }

    static Modulo fact(int n, bool sw = true) {
        static std::vector <Modulo> v1 = {1}, v2 = {1};
        if (n >= (int) v1.size()) {
            const int from = v1.size(), to = n + 1024;
            v1.reserve(to);
            v2.reserve(to);
            for (int i = from; i < to; ++i) {
                v1.push_back(v1.back() * Modulo<M, true>(i));
                v2.push_back(v2.back() / Modulo<M, true>(i));
            }
        }
        return sw ? v1[n] : v2[n];
    }

    static Modulo comb(int a, int b) {
        if (b < 0 || b > a) return 0;
        return Modulo::fact(a, true) * Modulo::fact(b, false) *
               Modulo::fact(a - b, false);
    }
};

typedef Modulo<1000000007, true> mInt;

mInt memo[64][2][2][2];
bool flag[64][2][2][2];

long long A, B;

mInt f(int pos, int aBig, int bLess, int fst) {
    if (pos == -1) {
        return 1ll;
    }

    if (flag[pos][aBig][bLess][fst]) {
        return memo[pos][aBig][bLess][fst];
    }
    int cA = A >> pos & 1;
    int cB = B >> pos & 1;

    mInt ans = 0;
    for (int b = 0; b < 2; b++) {
        if (bLess || b <= cB) {
            int nBless = bLess || b < cB;
            for (int a = 0; a <= b; a++) {
                if (aBig || a >= cA) {
                    if( fst == 0 && b == 1 && a == 0){
                        continue;
                    }
                    int nAbig = aBig || a > cA;
                    int nFst = fst || (a == 1 && b == 1);
                    ans += f(pos - 1, nAbig, nBless, nFst);
                }
            }
        }
    }
    flag[pos][aBig][bLess][fst] = 1;
    return memo[pos][aBig][bLess][fst] = ans;
}


int main() {
    cin >> A >> B;
    cout << (int) f(63, 0, 0, 0) << endl;
}

// x^y < y % x <= x+y
// x and y should share some bit
// 1101
//



Measured memory_bytes: 256