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
  
  
  def solve(n):
      s = bin(n)[2:][::-1]
      m = len(s)
      X = []
      for i in range(m)[::-1]:
          if s[i] == "1":
              X.append(i)
      res = 0
      t = len(X)
      for i in range(t):
          res += pow(3, X[i], mod) * pow(2, i, mod)
          res %= mod
      res += pow(2, t, mod) - 1
      res %= mod
      res *= (mod + 1) // 2
      res %= mod
      return res
  
  
  L, R = map(int, input().split())
  print(solve(R) - solve(L - 1))
  
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."}]