#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define __builtin_popcount __builtin_popcountll

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<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
    os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const map<S, T> &t) {
    os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<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> 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);}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;


int T, n, m;
ll l, r;

const int N = 64;

ll dp[N][16];

ll calc(ll l, ll r) {
    vi vl, vr;
    while(r) {
        vr.push_back(r & 1);
        r >>= 1;
        vl.push_back(l & 1);
        l >>= 1;
    }
    reverse(ALL(vl));
    reverse(ALL(vr));
    int n = vr.size();
    memset(dp, 0, sizeof(dp));
    dp[0][0]= 1;
    REP(i, n) {
        REP(f, 16) {
            ll t = dp[i][f] % MOD;
            for(int x = 0; x < 2 ; x ++) {
                for (int y = 0; y < 2 ; y ++) {
                    if (!(f & 1) && x < vl[i]) continue;
                    if (!(f & 2) && vr[i] < y) continue;
                    if (!(f & 4) && y < x) continue;
                    if (!(f & 8) && y && !x) continue;
                    if (x && !y) continue;
                    int nf = f;
                    if (vl[i] < x) nf |= 1;
                    if (y < vr[i]) nf |= 2;
                    if (x < y) nf |= 4;
                    if (x) nf |= 8;
                    (dp[i + 1][nf] += t) %= MOD;
                }
            }
        }
    }
    ll ans = 0;
    REP(f, 8) {
        ans += dp[n][8 | f] % MOD;
    }
    return ans % MOD;
}

int main(int argc, char *argv[]){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    while(cin >> l >> r){
        cout << calc(l, r) << endl;
    }
    return 0;
}


Measured memory_bytes: 256