#include <bits/stdc++.h>
using namespace std;
long long int MOD = 1e9 + 7;
long long int INF = 1e18;
long long int sub(long long int a, long long int b, long long int p = MOD) {
  return ((a % p) - (b % p) + p) % p;
}
long long int mult(long long int a, long long int b, long long int p = MOD) {
  return ((a % p) * (b % p)) % p;
}
long long int add(long long int a, long long int b, long long int p = MOD) {
  return (a % p + b % p) % p;
}
long long int fpow(long long int n, long long int k, long long int p = MOD) {
  long long int r = 1;
  while (k > 0) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
    k = k >> 1;
  }
  return r;
}
long long int inv(long long int a, long long int p = MOD) {
  return fpow(a, p - 2, p);
}
long long int fdiv(long long int a, long long int b, long long int p = MOD) {
  long long int yinv = inv(b);
  long long int ans = (a * yinv) % p;
  return ans;
}
unsigned long long int I1018 = 1000000000000000000;
const unsigned long long int I10e5 = 100000;
const long long int I10e6 = 1e6;
void printVecpll(std::vector<pair<long long int, long long int>> v) {
  for (auto p : v) {
    cout << p.first << " " << p.second << endl;
  }
}
template <typename T>
istream &operator>>(istream &in, vector<T> &a) {
  for (auto &item : a) {
    in >> item;
  }
  return in;
}
template <typename T, typename U>
ostream &operator<<(ostream &out, pair<T, U> &a) {
  cout << a.first << " " << a.second;
  return out;
}
template <typename T, typename U>
ostream &operator<<(ostream &out, map<T, U> &a) {
  for (auto &item : a) {
    out << item << endl;
  }
  return out;
}
template <typename T>
ostream &operator<<(ostream &out, vector<T> &a) {
  for (auto &item : a) {
    out << item << " ";
  }
  return out;
}
template <typename T>
ostream &operator<<(ostream &out, vector<vector<T>> &a) {
  for (auto &item : a) {
    out << item << "\n";
  }
  return out;
}
template <typename T>
ostream &operator<<(ostream &out, set<T> &a) {
  for (auto &item : a) {
    out << item << " ";
  }
  return out;
}
std::vector<bool> is_prime;
std::vector<long long int> primes;
void sieve(long long int n) {
  is_prime.resize(n + 2, true);
  primes.clear();
  long long int p;
  for (p = 2; p * p <= n; p++) {
    if (is_prime[p]) {
      long long int i;
      for (i = p * p; i <= n; i += p) {
        is_prime[i] = false;
      }
    }
  }
  is_prime[0] = is_prime[1] = false;
  long long int i;
  for (i = 2; i <= n; i++) {
    if (is_prime[i]) {
      primes.emplace_back(i);
    }
  }
}
set<long long int> prime_factor(long long int n) {
  sieve(n);
  long long int i;
  set<long long int> s;
  for (auto p : primes) {
    if (p > sqrt(n)) break;
    while (n % p == 0 && n > 1) {
      s.insert(p);
      n /= p;
    }
  }
  if (n > 1) {
    s.insert(n);
  }
  return s;
}
std::vector<long long int> fact_vec;
void fact_fun(long long int n) {
  fact_vec.resize(n + 10);
  long long int i;
  fact_vec[0] = 1;
  for (i = 1; i <= n + 2; i++) {
    fact_vec[i] = (fact_vec[i - 1] * i) % MOD;
  }
}
long long int npr(long long int n, long long int r) {
  long long int ans = fact_vec[n];
  ans /= fact_vec[n - r];
  return ans;
}
long long int ncr(long long int n, long long int r) {
  long long int ans = fact_vec[n];
  ans /= fact_vec[n - r];
  ans /= fact_vec[r];
  return ans;
}
class Sol {
 public:
  Sol() {}
};
long long int sum(long long int a, long long int n) {
  long long int temp;
  long long int t2 = mult(a, 2);
  t2 = add(t2, mult(sub(n, 1), 2));
  temp = mult(n, t2);
  temp = fdiv(temp, 2);
  return temp;
}
long long int solve(long long int r) {
  long long int i = 0;
  if (r == 0) return 0;
  long long int ao = 1, ae = 2;
  long long int ans = 0;
  long long int curr = 0;
  while (true) {
    long long int p = pow(2ll, i);
    if (curr + p > r) {
      long long int req = r - curr;
      if (i % 2 == 0) {
        ans = add(ans, sum(ao, req));
        ao = add(ao, mult(sub(p + 1, 1), 2));
      } else {
        ans = add(ans, sum(ae, req));
        ae = add(ae, mult(sub(p + 1, 1), 2));
      }
      return ans;
      break;
    }
    if (i % 2 == 0) {
      ans = add(ans, sum(ao, p));
      ao = add(ao, mult(sub(p + 1, 1), 2));
    } else {
      ans = add(ans, sum(ae, p));
      ae = add(ae, mult(sub(p + 1, 1), 2));
    }
    curr += p;
    i++;
  }
}
int main() {
  long long int i, j;
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long int l, r;
  cin >> l >> r;
  long long int a1 = solve(l - 1);
  long long int a2 = solve(r);
  long long int ans = sub(a2, a1);
  cout << ans << endl;
  return 0;
}
