output_description: Print the number of pairs of integers (x, y) (L \leq x \leq y \leq R)
  satisfying the condition, modulo 10^9 + 7.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      L R
attempt: mod = 10**9 + 7
  
  
  # xと最上位bitが同じでx以下のもののスコア足し上げ
  def countup(x, y):
      L1 = x.bit_length()
      x -= 1 << (L1 - 1)
      y -= 1 << (L1 - 1)
      L = x.bit_length()
      dp = [[[0, 0], [0, 0]] for _ in range(L + 1)]
      # 立ってるbitがlこのもの
      dp[0][0][0] = 1
      for i in range(L):
          a = x & (1 << (L - 1 - i))
          b = y & (1 << (L - 1 - i))
          if a:
              if b:
                  dp[i + 1][0][0] = dp[i][0][0]
                  dp[i + 1][0][1] = 2 * dp[i][0][1] % mod
                  dp[i + 1][1][0] = dp[i][1][0]
                  dp[i + 1][1][1] = (3 * dp[i][1][1] + dp[i][0][1]) % mod
              else:
                  dp[i + 1][0][0] = dp[i][0][0]
                  dp[i + 1][0][1] = (dp[i][0][0] + 2 * dp[i][0][1]) % mod
                  dp[i + 1][1][0] = (dp[i][0][0] + 2 * dp[i][1][0]) % mod
                  dp[i + 1][1][1] = (3 * dp[i][1][1] + dp[i][0][1] + dp[i][1][0]) % mod
          else:
              if not b:
                  dp[i + 1][0][0] = dp[i][0][0]
                  dp[i + 1][0][1] = dp[i][0][1]
                  dp[i + 1][1][0] = 2 * dp[i][1][0] % mod
                  dp[i + 1][1][1] = (3 * dp[i][1][1] + dp[i][1][0]) % mod
              else:
                  dp[i + 1][0][1] = dp[i][0][1]
                  dp[i + 1][1][0] = dp[i][1][0]
                  dp[i + 1][1][1] = 3 * dp[i][1][1] % mod
      return sum(dp[L][0]) + sum(dp[L][1]) % mod
  
  
  def main():
      Left, Right = map(int, input().split())
      ans = 0
      while True:
          # print(bin(Right))
          bl = Left.bit_length()
          br = Right.bit_length()
          if bl == br:
              ans = (ans + countup(Right, Left)) % mod
              break
          else:
              ans = (ans + countup(Right, (1 << (br - 1)))) % mod
              Right = (1 << (br - 1)) - 1
  
      print(ans)
  
  
  if __name__ == "__main__":
      main()
  
problem_description: Statement
  
  Given are integers L and R. Find the number, modulo 10^9 + 7, of pairs of
  integers (x, y) (L \leq x \leq y \leq R) such that the remainder when y is
  divided by x is equal to y \mbox{ XOR } x.
  
  What is \mbox{ XOR }?
  
  The XOR of integers A and B, A \mbox{ XOR } B, is defined as follows:
  
    * When A \mbox{ XOR } B is written in base two, the digit in the 2^k's place (k \geq 0) is 1 if either A or B, but not both, has 1 in the 2^k's place, and 0 otherwise.
  
  For example, 3 \mbox{ XOR } 5 = 6. (In base two: 011 \mbox{ XOR } 101 = 110.)
samples: [{"input": "2 3", "output": "3\n    \n\nThree pairs satisfy the condition: (2, 2), (2, 3), and (3, 3).\n\n* * *"}, {"input": "10 100", "output": "604\n    \n\n* * *"}, {"input": "1 1000000000000000000", "output": "68038601\n    \n\nBe sure to compute the number modulo 10^9 + 7."}]