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: L, R = map(int, input().split())
  
  
  dp = []
  
  for i in range(62):
  
      nowA = []
  
      for i in range(2):
  
          nowB = []
  
          for i in range(2):
  
              nowC = []
  
              for i in range(2):
  
                  nowC.append(0)
  
              nowB.append(nowC)
  
          nowA.append(nowB)
  
      dp.append(nowA)
  
  dp[0][0][0][0] = 1
  # print (dp[3][0][0][0])
  
  
  for i in range(61):
  
      i += 1
      keta = 62 - i
  
      lb = (L >> (keta - 1)) % 2
      rb = (R >> (keta - 1)) % 2
  
      for j in range(2):
          for k in range(2):
              for m in range(2):
  
                  pre = dp[i - 1][j][k][m]
  
                  for x in range(2):
                      for y in range(2):
  
                          nj = j
                          nk = k
                          nm = m
  
                          if x == 1 and y == 0:
                              continue
  
                          if x != y and m == 0:
                              continue
  
                          if j == 0 and lb == 1 and x == 0:
                              continue
  
                          if k == 0 and rb == 0 and y == 1:
                              continue
  
                          if j == 0 and lb == 0 and x == 1:
                              nj = 1
  
                          if k == 0 and rb == 1 and y == 0:
                              nk = 1
  
                          if m == 0 and x == 1 and y == 1:
                              nm = 1
  
                          dp[i][nj][nk][nm] += dp[i - 1][j][k][m]
                          dp[i][nj][nk][nm] %= 10**9 + 7
  
  ans = 0
  
  for j in range(2):
      for k in range(2):
  
          ans += dp[-1][j][k][1]
  
  print(ans % (10**9 + 7))
  
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."}]