L, R = gets.split.map(&:to_i)
M = 10**9 + 7

#  y % x == y ^ x  ==>  y.to_s(2).length == x.to_s(2).length && y - x == y ^ x
#  1-1 == 1^1 = 0, 1-0 == 1^0 = 1, 0-0 == 0^0 = 0, but 0-1 = -1 != 0^1 = 1
m = (10**18).to_s(2).length
#  dp[digit][L<=x?][y<=R?][msb?]
dp = Array.new(m + 1){Array.new(2){Array.new(2){Array.new(2, 0)}}}
dp[m][0][0][0] = 1  # x, y = 1, 1
c3 = [0, 1].repeated_permutation(3)
c2 = [[0, 0], [0, 1], [1, 1]]  # x, y != 1, 0
(m - 1).downto(0).each do |i|
  l, r = L >> i & 1, R >> i & 1
  c3.each do |j, k, s|
    d0 = dp[i + 1][j][k][s] % M
    c2.each do |x, y|
      next if s == 0 && x != y
      next if j == 0 && x == 0 && l == 1
      next if k == 0 && y == 1 && r == 0
      nj, nk, ns = j, k, s
      nj = 1 if x == 1 && l == 0
      nk = 1 if y == 0 && r == 1
      ns = 1 if x == 1 && y == 1
      dp[i][nj][nk][ns] += d0
    end
  end
end
puts dp[0].flatten.inject(:+) % M