#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }


int main() {
  ll L, R; cin >> L >> R;
  ll dp[63][2][2][2] = {}; dp[62][0][0][0] = 1; // i, top, L, R
  per(i,62) {
    // dp[i+1][0][0][0]
    if (R&(1ull<<i)) {
      if (L&(1ull<<i)) dp[i][1][0][0] = ( dp[i][1][0][0]+dp[i+1][0][0][0] ) % MOD;
      else dp[i][1][1][0] = ( dp[i][1][1][0]+dp[i+1][0][0][0] ) % MOD;
    }
    if (!(L&(1ull<<i))) {
      if (R&(1ull<<i)) dp[i][0][0][1] = ( dp[i][0][0][1]+dp[i+1][0][0][0] ) % MOD;
      else dp[i][0][0][0] = ( dp[i][0][0][0]+dp[i+1][0][0][0] ) % MOD;      
    }
    // dp[i+1][0][0][1]
    if (true) {
      if (L&(1ull<<i)) dp[i][1][0][1] = ( dp[i][1][0][1]+dp[i+1][0][0][1] ) % MOD;
      else dp[i][1][1][1] = ( dp[i][1][1][1]+dp[i+1][0][0][1] ) % MOD;
    }
    if (!(L&(1ull<<i))) {
      dp[i][0][0][1] = ( dp[i][0][0][1]+dp[i+1][0][0][1] ) % MOD;      
    }
    // dp[i+1][1][0][0]
    if (!(L&(1ull<<i))) {
      if (R&(1ull<<i)) dp[i][1][0][1] = ( dp[i][1][0][1]+dp[i+1][1][0][0] ) % MOD;
      else dp[i][1][0][0] = ( dp[i][1][0][0]+dp[i+1][1][0][0] ) % MOD;
    }
    if (!(L&(1ull<<i))&&(R&(1ull<<i))) dp[i][1][0][0] = ( dp[i][1][0][0]+dp[i+1][1][0][0] ) % MOD;
    if (R&(1ull<<i)) {
      if (L&(1ull<<i)) dp[i][1][0][0] = ( dp[i][1][0][0]+dp[i+1][1][0][0] ) % MOD;
      else dp[i][1][1][0] = ( dp[i][1][1][0]+dp[i+1][1][0][0] ) % MOD;
    }
    // dp[i+1][1][0][1]
    if (!(L&(1ull<<i))) {
      dp[i][1][0][1] = ( dp[i][1][0][1]+dp[i+1][1][0][1] ) % MOD;
    }
    if (!(L&(1ull<<i))) dp[i][1][0][1] = ( dp[i][1][0][1]+dp[i+1][1][0][1] ) % MOD;
    if (true) {
      if (L&(1ull<<i)) dp[i][1][0][1] = ( dp[i][1][0][1]+dp[i+1][1][0][1] ) % MOD;
      else dp[i][1][1][1] = ( dp[i][1][1][1]+dp[i+1][1][0][1] ) % MOD;
    }
    // dp[i+1][1][1][0]
    if (true) {
      if (R&(1ull<<i)) dp[i][1][1][1] = ( dp[i][1][1][1]+dp[i+1][1][1][0] ) % MOD;
      else dp[i][1][1][0] = ( dp[i][1][1][0]+dp[i+1][1][1][0] ) % MOD;
    }
    if (R&(1ull<<i)) dp[i][1][1][0] = ( dp[i][1][1][0]+dp[i+1][1][1][0] ) % MOD;
    if (R&(1ull<<i)) {
      dp[i][1][1][0] = ( dp[i][1][1][0]+dp[i+1][1][1][0] ) % MOD;
    }
    // dp[i+1][1][1][1]
    dp[i][1][1][1] = ( dp[i][1][1][1] + dp[i+1][1][1][1]*3 ) % MOD;

    // cout << i << endl;
    // cout << (!(L&(1ull<<i))) << " " << (R&(1ull<<i)) << endl;
    // cout << dp[i][0][0][0] << " " << dp[i][0][0][1] << " " << dp[i][0][1][0] << " " << dp[i][0][1][1] << endl;
    // cout << dp[i][1][0][0] << " " << dp[i][1][0][1] << " " << dp[i][1][1][0] << " " << dp[i][1][1][1] << endl;
  }

  ll result = (dp[0][1][0][0]+dp[0][1][0][1]+dp[0][1][1][0]+dp[0][1][1][1]) % MOD;
  cout << result << endl;
  return 0;
}

Measured memory_bytes: 384