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

#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define MP make_pair
#define rep(i,n,m) for(ll i = n; i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = n - 1; i >= (ll)(m); i--)
typedef long long ll;
typedef long double ld;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>v,ll n){cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
//m.emplace(x,0).fi->se++;

int main(){
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);
  ll res=0,res1=INF,res2=-INF,buf=0;
  bool judge = true;
  ll l,r;cin>>l>>r;
  bitset<80> x,y;
  x=l;
  y=r;
  buf=1;
  ll cntx=0;
  ll cnty=0;
  vector<ll>th(86);
  th[0]=1;
  rep(i,0,85)qmod(th[i+1],th[i],3);
  rrep(i,80,0){
    if(x[i])chmax(cntx,i);
    if(y[i])chmax(cnty,i);
  }
  rrep(i,80,0){
    if(cnty==i&&cntx==i){
      judge=true;
      rrep(j,i,0){
        if(y[j]==1&&x[j]==0){
          ll tmp=1;
          rrep(o,j,0){
            if(y[o]){
              pmod(res,(th[o]*tmp)%MOD);
              qmod(tmp,2);
            }
          }
          pmod(res,tmp);
          tmp=1;
          rrep(o,j,0){
            if(x[o]==0){
              pmod(res,(th[o]*tmp)%MOD);
              qmod(tmp,2);
            }
          }
          pmod(res,tmp);
        }
        if(x[j]==1&&y[j]==0){
          judge=false;
          break;
        }
      }
      if(judge)pmod(res,1);
      break;
    }
    else if(cnty==i){
      ll tmp=1;
      rrep(j,i,0){
        if(y[j]){
          pmod(res,(th[j]*tmp)%MOD);
          qmod(tmp,2);
        }
        //cout<<res<<endl;
      }
      pmod(res,tmp);
      //cout<<res<<endl;
    }
    else if(cnty>i&&i>cntx){
      pmod(res,th[i]);
      //cout<<res<<endl;
    }
    else if(cntx==i){
      ll tmp=1;
      rrep(j,i,0){
        if(x[j]==0){
          pmod(res,(th[j]*tmp)%MOD);
          qmod(tmp,2);
        }
      }
      pmod(res,tmp);
      break;
    }
  }
  cout<<res<<endl;
  return 0;
}

Measured memory_bytes: 256