#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define fst first
#define snd second

/* clang-format off */
template <class T, size_t D> struct _vec { using type = vector<typename _vec<T, D - 1>::type>; };
template <class T> struct _vec<T, 0> { using type = T; };
template <class T, size_t D> using vec = typename _vec<T, D>::type;
template <class T> vector<T> make_v(size_t size, const T& init) { return vector<T>(size, init); }
template <class... Ts> auto make_v(size_t size, Ts... rest) { return vector<decltype(make_v(rest...))>(size, make_v(rest...)); }
template <class T> inline void chmin(T &a, const T& b) { if (b < a) a = b; }
template <class T> inline void chmax(T &a, const T& b) { if (b > a) a = b; }
/* clang-format on */

const int bits = 62;

template <std::uint_fast64_t Modulus>
class modint {
  using u64 = std::uint_fast64_t;

 public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept
      : a(x % Modulus) {
  }
  constexpr u64 &value() noexcept {
    return a;
  }
  constexpr const u64 &value() const noexcept {
    return a;
  }
  constexpr modint operator+(const modint rhs) const noexcept {
    return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
    return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
    return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
    return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
    a += rhs.a;
    if (a >= Modulus) {
      a -= Modulus;
    }
    return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
    if (a < rhs.a) {
      a += Modulus;
    }
    a -= rhs.a;
    return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
    a = a * rhs.a % Modulus;
    return *this;
  }
  constexpr modint &operator/=(const modint rhs) noexcept {
    return *this *= ~rhs;
  }
  constexpr modint operator^(u64 exp) const noexcept {
    modint v = 1, x = *this;
    while (exp) {
      if (exp & 1) {
        v *= x;
      }
      x *= x;
      exp >>= 1;
    }
    return v;
  }
  constexpr modint operator~() const noexcept {
    return *this ^ (Modulus - 2);
  }
};

using mint = modint<1000000007>;

int y[] = {1, 0, 1};
int x[] = {0, 0, 1};

int main() {
#ifdef DEBUG
  ifstream ifs("in.txt");
  cin.rdbuf(ifs.rdbuf());
#endif
  ll L, R;
  while (cin >> L >> R) {
    vector<int> binL(bits), binR(bits);
    for (int i = 0; i < bits; i++) binL[bits - i - 1] = (L >> i) & 1;
    for (int i = 0; i < bits; i++) binR[bits - i - 1] = (R >> i) & 1;
    vec<mint, 3> dp = make_v(2, 2, 2, mint(0));
    dp[0][0][0] = 1;
    for (int i = 0; i < bits; i++) {
      vec<mint, 3> ndp = make_v(2, 2, 2, mint(0));
      for (int present = 0; present < 2; present++) {
        for (int less = 0; less < 2; less++) {
          for (int over = 0; over < 2; over++) {
            for (int k = present ? 0 : 1; k < 3; k++) {
              if (!less && y[k] > binR[i]) continue;
              if (!over && x[k] < binL[i]) continue;
              ndp[present | (k == 2)][less | (y[k] < binR[i])][over | (x[k] > binL[i])] += dp[present][less][over];
            }
          }
        }
      }
      dp = ndp;
    }
    mint res = 0;
    for (int less = 0; less < 2; less++) {
      for (int over = 0; over < 2; over++) {
        res += dp[1][less][over];
      }
    }
    cout << res.value() << endl;
  }
  return 0;
}


Measured memory_bytes: 256