#include <iostream>
#include <array>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <math.h>
#include <string>
#include <climits>
#include <assert.h>
#include <iomanip>
#include <bitset>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <fstream>

#define SIZE(x) int(x.size())
#define FOR(i,a,n) for(int i=(a);i<(n); ++i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define IS_BIT_ON(bit, i) (bit & (1 << i))
#define BIT_ON(bit, i) (bit |= (1 << i))
#define BIT_OFF(bit, i) (bit &= ~(1 << i))
#define BIT_COUNT(bit) (__builtin_popcount(bit))

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail) != 0) {std::cout << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void print(std::vector<T> &v) {for (auto& a : v) { std::cout << a; if (&a != &v.back()) {std::cout << " ";} }std::cout << std::endl;}
template <class T> void print(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
void debug() { std::cerr << std::endl; }
template <class Head, class... Tail> void debug(Head&& head, Tail&&... tail) { std::cerr << head; if (sizeof...(tail) != 0) {std::cerr << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void debug(std::vector<T> &v) {for (auto& a : v) { std::cerr << a; if (&a != &v.back()) {std::cerr << " ";} }std::cerr << std::endl;}
template <class T> void debug(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }

template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}

long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

bool is_power_of_two(long long x) {
    return !(x & (x - 1));
}

long long gcd(long long a, long long b) {
    if (b == 0) { return a; }
    return gcd(b, a % b);
}

long long gcd(std::vector<long long> &v) {
    long long ans = v[0];
    for (int i = 1; i < (int)v.size(); ++i) {
        ans = gcd(ans, v[i]);
    }
    return ans;
}

long long lcm(long long a, long long b) {
    long long g = gcd(a, b);
    return a / g * b;
}

const int INF = 1u << 30u;
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

int mod = 1000000000 + 7;
vector<int> L, R;
vector<vector<vector<vector<int>>>> dp;
// L <= x <= y <= Rでyとxの関係が(1, 1), (1, 0), (0, 0)のどれか
// 最初は(1, 1)じゃないとだめ
long long digit_dp(int digit, bool is_tight_l, bool is_tight_r, bool leading_zero) {
    if (digit >= SIZE(L)) {
        return 1;
    }

    if (dp[digit][is_tight_l][is_tight_r][leading_zero] != -1) {
        return dp[digit][is_tight_l][is_tight_r][leading_zero];
    }

    LL ans = 0;

    // (1, 1)
    if (not is_tight_r or R[digit] == 1) {
        bool next_is_tight_l = is_tight_l and (L[digit] == 1);
        bool next_is_tight_r = is_tight_r and (R[digit] == 1);
        (ans += digit_dp(digit + 1, next_is_tight_l, next_is_tight_r, false)) %= mod;
    }

    // (0, 0)
    if (not is_tight_l or L[digit] == 0) {
        bool next_is_tight_l = is_tight_l and (L[digit] == 0);
        bool next_is_tight_r = is_tight_r and (R[digit] == 0);
        (ans += digit_dp(digit + 1, next_is_tight_l, next_is_tight_r, leading_zero)) %= mod;
    }

    // (1, 0)
    if (not leading_zero) {
        if ((not is_tight_r or R[digit] == 1) and (not is_tight_l or L[digit] == 0)) {
            bool next_is_tight_l = is_tight_l and (L[digit] == 0);
            bool next_is_tight_r = is_tight_r and (R[digit] == 1);
            (ans += digit_dp(digit + 1, next_is_tight_l, next_is_tight_r, false)) %= mod;
        }
    }

    return dp[digit][is_tight_l][is_tight_r][leading_zero] = ans % mod;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    LL l, r;
    cin >> l >> r;
    while (l > 0) {
        L.emplace_back(l % 2);
        l /= 2;
    }
    while (r > 0) {
        R.emplace_back(r % 2);
        r /= 2;
    }
    while (SIZE(L) < 60) {
        L.emplace_back(0);
    }
    while (SIZE(R) < 60) {
        R.emplace_back(0);
    }
    reverse(ALL(L));
    reverse(ALL(R));
    assert(SIZE(L) == 60 and SIZE(R) == 60);
    dp = make_v<int>(70, 2, 2, 2);
    fill_v(dp, -1);

    print(digit_dp(0, true, true, true));

    return 0;
}


Measured memory_bytes: 256