/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author aajisaka
 */

#include<bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SPEED ios_base::sync_with_stdio(false);cin.tie(nullptr)
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define all(v) v.begin(), v.end()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

using ll = long long;
using P = pair<ll, ll>;

constexpr double PI = 3.14159265358979323846;
mt19937_64 engine(chrono::steady_clock::now().time_since_epoch().count());
#include<vector>

constexpr ll mod17 = 1e9+7;
constexpr ll mod19 = 1e9+9;
constexpr ll mod9 = 998244353;
ll mod = mod17;

// Mod int library
unordered_map<ll, ll> minvmap;
ll minv(ll a, ll m) {
  auto k = a; auto p = minvmap[a]; if (p != 0) return p;
  ll b = m, u = 1, v = 0;
  while (b) { ll t = a/b; swap(a -= t*b, b); swap(u -= t*v, v); }
  p = (u%m+m)%m; minvmap[k] = p; return p;
}

struct mint {
  ll x;
  mint():x(0){}
  mint(ll x):x((x%mod+mod)%mod){}
  mint& fix() { x = (x%mod+mod)%mod; return *this;}
  mint operator-() const { return mint(0) - *this;}
  mint& operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;}
  mint& operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;}
  mint& operator*=(const mint& a){ (x*=a.x)%=mod; return *this;}
  mint& operator/=(const mint& a){ (x*=minv(a.x, mod))%=mod; return *this; }
  mint operator+(const mint& a)const{ return mint(*this) += a;}
  mint operator-(const mint& a)const{ return mint(*this) -= a;}
  mint operator*(const mint& a)const{ return mint(*this) *= a;}
  mint operator/(const mint& a)const{ return mint(*this) /= a;}
  bool operator<(const mint& a)const{ return x < a.x;}
  bool operator==(const mint& a)const{ return x == a.x;}
};

template<typename T>
T mod_pow(T a, ll x) {
  T res = 1;
  while(x > 0) {
    if (x & 1) res *= a;
    a *= a; x >>= 1;
  }
  return res;
}

class combination {
    // factorial
    public: std::vector<mint> fact;
    public: std::vector<mint> inv;

    combination(int n) {
      fact.resize(n + 1);
      inv.resize(n + 1);
      fact[0] = 1;
      for (int i = 1; i <= n; i++) {
        fact[i] = fact[i - 1] * i;
      }
      inv[n] = mint(1) / fact[n];
      for (int i = n - 1; i >= 0; i--) {
        inv[i] = inv[i + 1] * (i + 1);
      }
    }

    // nCr
    public: mint get(int n, int r) {
      if (n < r || n < 0 || r < 0) return 0;
      return fact[n]*inv[r]*inv[n-r];
    }
    // nPr
    public: mint p(int n, int r) {
      if (n < r || n < 0) return 0;
      return fact[n]*inv[n-r];
    }
};

mint dp[64][2][2][2];
// n, a, b, c;
// a: y is always equal to or smaller than R
// b: x is always equal to or greater than L
// c: (1, 1) is occurred

class FCoincidence {
public:

    mint count(ll L, ll R) {
      vector<int> x;
      vector<int> y;
      ll tmp = L;
      rep(i, 63) {
        x.push_back(tmp%2);
        tmp/=2;
      }
      tmp = R;
      rep(i, 63) {
        y.push_back(tmp%2);
        tmp/=2;
      }
      reverse(all(x));
      reverse(all(y));
      int n = x.size();
      rep(i, 64) rep(j, 2) rep(k, 2) rep(l, 2) {
        dp[i][j][k][l] = 0;
      }

      dp[0][0][0][0] = 1;
      for(int i=1; i<n; i++) {
        // y=0; x=0
        dp[i][1][1][1] += dp[i-1][1][1][1];
        dp[i][1][1][0] += dp[i-1][1][1][0];
        if (y[i] == 1 && x[i] == 0) {
          dp[i][1][0][0] += dp[i-1][0][0][0];
          dp[i][1][0][1] += dp[i-1][0][0][1];
        } else if (y[i] == 0 && x[i] == 0) {
          dp[i][0][0][0] += dp[i-1][0][0][0];
          dp[i][0][0][1] += dp[i-1][0][0][1];
        }
        if (x[i] == 0) {
          dp[i][1][0][0] += dp[i-1][1][0][0];
          dp[i][1][0][1] += dp[i-1][1][0][1];
        }
        if (y[i] == 1) {
          dp[i][1][1][0] += dp[i-1][0][1][0];
          dp[i][1][1][1] += dp[i-1][0][1][1];
        } else {
          dp[i][0][1][0] += dp[i-1][0][1][0];
          dp[i][0][1][1] += dp[i-1][0][1][1];
        }

        // y=1; x=0
        dp[i][1][1][1] += dp[i-1][1][1][1];
        if (y[i] == 1 && x[i] == 0) {
          dp[i][0][0][1] += dp[i-1][0][0][1];
        }
        if (x[i] == 0) {
          dp[i][1][0][1] += dp[i-1][1][0][1];
        }
        if (y[i] == 1) {
          dp[i][0][1][1] += dp[i-1][0][1][1];
        }

        // y=1; x=1
        dp[i][1][1][1] += dp[i-1][1][1][1];
        dp[i][1][1][1] += dp[i-1][1][1][0];
        if (y[i] == 1 && x[i] == 1) {
          dp[i][0][0][1] += dp[i-1][0][0][0];
          dp[i][0][0][1] += dp[i-1][0][0][1];
        } else if (y[i] == 1 && x[i] == 0) {
          dp[i][0][1][1] += dp[i-1][0][0][0];
          dp[i][0][1][1] += dp[i-1][0][0][1];
        }
        if (x[i] == 1) {
          dp[i][1][0][1] += dp[i-1][1][0][0];
          dp[i][1][0][1] += dp[i-1][1][0][1];
        } else if (x[i] == 0) {
          dp[i][1][1][1] += dp[i-1][1][0][0];
          dp[i][1][1][1] += dp[i-1][1][0][1];
        }
        if (y[i] == 1) {
          dp[i][0][1][1] += dp[i-1][0][1][0];
          dp[i][0][1][1] += dp[i-1][0][1][1];
        }
      }
      mint ans = 0;
      rep(i, 2) rep(j, 2) rep(k, 2) {
        ans += dp[n-1][i][j][k];
      }
      return ans;
    }

    void solve(istream& cin, ostream& cout) {
      SPEED;
      ll L, R; cin >> L >> R;
      cout << count(L, R).x << endl;
    }
};

signed main() {
  FCoincidence solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}

Measured memory_bytes: 256