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: def s(n):
      return sum([ord(x) - ord("0") for x in str(n)])
  
  
  def r(n):
      return n / s(n)
  
  
  def f(n):
      d = 10
      m = n
      while d <= n * 10:
          n //= d
          n *= d
          n += d - 1
          d *= 10
          if r(n) < r(m):
              m = n
      return m
  
  
  n = 1
  for _ in range(int(input())):
      print(n)
      n = f(n + 1)
  
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"}]