#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;

#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
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; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'

void print_bit(int x) {
  int mask = 1 << 6;
  while (mask > 0) {
    if (mask & x) {
      cout << 1;
    }
    else {
      cout << 0;
    }
    mask >>= 1;
  }
}


ll mod_pow(ll x, ll p, ll M = MOD) {
  ll a = 1;
  while (p) {
    if (p % 2)
      a = a*x%M;
    x = x*x%M;
    p /= 2;
  }
  return a;
}

ll mod_inverse(ll a, ll M = MOD) {
  return mod_pow(a, M - 2, M);
}

ll ketadp(ll l, ll r) {
  int n = 62;
  vector<vector<vll>> dp(n + 1, vector<vll>(2, vll(2, vl(2))));
  dp[n][0][1][1] = 1;
  for (int keta = n; keta > 0; keta--) {
    int nketa = keta - 1;
    rep (al, 2) {
      rep (i, 2) {
        rep (j, 2) {
          if (dp[keta][al][i][j] == 0) continue;
          rep (x, 2) {
            rep (y, 2) {
              if (x == 1 and y == 0) continue;
              int nal;
              if (al == 1) nal = 1;
              else {
                if (x == y) nal = x;
                else continue;
              }
              int ni, nj;
              if (i == 0) {
                ni = 0;
              }
              else {
                if (l & (1LL << nketa)) {
                  if (x == 0) ni = 0;
                  else ni = 1;
                }
                else {
                  if (x == 0) ni = 1;
                  else continue;
                }
              }

              if (j == 0) {
                nj = 0;
              }
              else {
                if (r & (1LL << nketa)) {
                  if (y == 0) nj = 0;
                  else nj = 1;
                }
                else {
                  if (y == 0) nj = 1;
                  else continue;
                }
              }
              (dp[nketa][nal][ni][nj] += dp[keta][al][i][j]) %= MOD;
              //DEBUG(pii(keta, al));
              //DEBUG(pii(i, j));
              //DEBUG(pii(x, y));


            }


          }
          
        }
      }
    }

  }
  ll ans = 0;
  rep (i, 2) rep (j, 2) rep (k, 2) {
    ans = (ans + dp[0][i][j][k]) % MOD;
  }
  return ans;
}

int main() {
  ll l, r;
  cin >> l >> r;

  ll dp1 = ketadp(r, r);
  ll dp2 = ketadp(l - 1, r);
  ll ans =(dp1 - dp2 + MOD) % MOD;
  ans = (ans + MOD) % MOD;
  cout << ans << endl;
}


Measured memory_bytes: 256