output_description: Print all the integers that satisfies the condition above in ascending order.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B K
attempt: from collections import deque
  
  a, b, c = map(int, input().split())
  
  
  def bfs(a, b, c):
      cnt = 0
      queue = deque([[a, b, c, cnt]])
  
      while queue:
          a, b, c, cnt = queue.popleft()
          if a == b and b == c:
              return cnt
          if a >= 52 or b >= 52 or c >= 52:
              return cnt
  
          if b > a and b > c:
              queue.append([a + 1, b, c + 1, cnt + 1])
          elif a > b and a > b:
              queue.append([a, b + 1, c + 1, cnt + 1])
          elif c > a and c > b:
              queue.append([a + 1, b + 1, c, cnt + 1])
          elif a < b or a < c:
              queue.append([a + 2, b, c, cnt + 1])
          elif b < a or b < c:
              queue.append([a, b + 2, c, cnt + 1])
          elif c < a or c < b:
              queue.append([a, b, c + 2, cnt + 1])
  
  
  print(bfs(a, b, c))
  
problem_description: Statement
  
  Print all the integers that satisfies the following in ascending order:
  
    * Among the integers between A and B (inclusive), it is either within the K smallest integers or within the K largest integers.
samples: [{"input": "3 8 2", "output": "3\n    4\n    7\n    8\n    \n\n  * 3 is the first smallest integer among the integers between 3 and 8.\n  * 4 is the second smallest integer among the integers between 3 and 8.\n  * 7 is the second largest integer among the integers between 3 and 8.\n  * 8 is the first largest integer among the integers between 3 and 8.\n\n* * *"}, {"input": "4 8 3", "output": "4\n    5\n    6\n    7\n    8\n    \n\n* * *"}, {"input": "2 9 100", "output": "2\n    3\n    4\n    5\n    6\n    7\n    8\n    9"}]