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 Counter, defaultdict, deque
  from heapq import heappop, heappush, heapify
  import sys, bisect, math, itertools
  
  sys.setrecursionlimit(10**8)
  mod = 10**9 + 7
  
  
  def inp():
      return int(sys.stdin.readline())
  
  
  def inpl():
      return list(map(int, sys.stdin.readline().split()))
  
  
  def inpln(n):
      return list(int(sys.stdin.readline()) for i in range(n))
  
  
  a, b, k = inpl()
  res = []
  for i in range(k):
      if a + i <= b and not a + i in res:
          res.append(a + i)
      if b - i >= a and not b - i in res:
          res.append(b - i)
  res.sort()
  print(*res)
  
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"}]