output_description: Print K lines. The i-th line should contain the i-th smallest Snuke number.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      K
attempt: import sys
  
  k = int(input())
  if k <= 9:
      for i in range(1, k + 1):
          print(i)
      sys.exit()
  for i in range(1, 9):
      print(i)
  count = 8
  s = 0
  lst = []
  for i in range(1, 17):
      for j in range(1, 1000):
          if j % 10 == 0:
              continue
          a = j * (10**i) - 1
          b = list(str(a))
          c = 0
          for u in b:
              c += int(u)
          if (10**i) * c >= a:
              lst.append(a)
              count += 1
              if count == k:
                  s = 10
                  break
          else:
              break
      if s == 10:
          break
  lst.sort()
  s = 1
  while s < len(lst):
      if lst[s] == lst[s - 1]:
          lst.pop(s)
      else:
          s += 1
  for u in lst:
      print(u)
  
problem_description: Statement
  
  Let S(n) denote the sum of the digits in the decimal notation of n. For
  example, S(123) = 1 + 2 + 3 = 6.
  
  We will call an integer n a **Snuke number** when, for all positive integers m
  such that m > n, \frac{n}{S(n)} \leq \frac{m}{S(m)} holds.
  
  Given an integer K, list the K smallest Snuke numbers.
samples: [{"input": "10", "output": "1\n    2\n    3\n    4\n    5\n    6\n    7\n    8\n    9\n    19"}]