// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

ll dp[70][2][2][2];

int main(int argc, char const* argv[])
{
  ll l, r;
  cin >> l >> r;
  vector<int> vl, vr;
  ll L = l, R = r;
  while(R){
    vr.pb(R % 2);
    R /= 2;
  }
  reverse(all(vr));
  while(L){
    vl.pb(L % 2);
    L /= 2;
  }
  while(sz(vl) < sz(vr))vl.pb(0);
  reverse(all(vl));

  dp[0][1][1][0] = 1;
  rep(i, sz(vr)){
    // 0 0
    // (dp[i+1][0][0][0] += dp[i][0][0][0]) %= mod;
    // (dp[i+1][0][0][1] += dp[i][0][0][0]) %= mod;
    (dp[i+1][0][0][1] += dp[i][0][0][1] * 3 % mod) %= mod;
    // 1 0
    if(vr[i] == 0){
      (dp[i+1][1][0][1] += dp[i][1][0][1]) %= mod;
    }else{
      (dp[i+1][1][0][1] += dp[i][1][0][1] * 2 % mod) %= mod;
      (dp[i+1][0][0][1] += dp[i][1][0][1]) %= mod;
    }
    // 0 1
    if(vl[i] == 1){
      (dp[i+1][0][1][1] += dp[i][0][1][0]) %= mod;
      (dp[i+1][0][1][1] += dp[i][0][1][1]) %= mod;
    }else{
      (dp[i+1][0][1][0] += dp[i][0][1][0]) %= mod;
      (dp[i+1][0][1][1] += dp[i][0][1][1] * 2 % mod) %= mod;
      (dp[i+1][0][0][1] += dp[i][0][1][0]) %= mod;
      (dp[i+1][0][0][1] += dp[i][0][1][1]) %= mod;
    }
    // 1 1
    if(vr[i] == 1){
      if(vl[i] == 0){
        (dp[i+1][1][0][1] += dp[i][1][1][0]) %= mod;
        (dp[i+1][1][0][1] += dp[i][1][1][1]) %= mod;
        (dp[i+1][0][1][1] += dp[i][1][1][1]) %= mod;
        (dp[i+1][1][1][1] += dp[i][1][1][1]) %= mod;
        (dp[i+1][0][1][0] += dp[i][1][1][0]) %= mod;
      }else{
        (dp[i+1][1][1][1] += dp[i][1][1][0]) %= mod;
        (dp[i+1][1][1][1] += dp[i][1][1][1]) %= mod;
      }
    }else{
      if(vl[i] == 0){
        (dp[i+1][1][1][0] += dp[i][1][1][0]) %= mod;
        (dp[i+1][1][1][1] += dp[i][1][1][1]) %= mod;
      }else{
        
      }
    }
    /*rep(j, 2){
      rep(k, 2){
        rep(l, 2){
          cout << i << " " << j << " " << k << " " << l << " " << dp[i+1][j][k][l] << endl;
        }
      }
      }*/
  }

  ll res = 0;
  rep(i, 2){
    rep(j, 2){
      (res += dp[sz(vr)][i][j][1]) %= mod;
    }
  }
  cout << res << endl;
  return 0;
}


Measured memory_bytes: 256