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: k = int(input())
  
  sn_max = 1
  div_max = 1
  sn_t = 1
  div_t = 1
  cnt = 0
  n = 0
  
  for i in range(1, min(k + 1, 10)):
      print(i)
      n += 1
      cnt += 1
  
  n += 10
  
  while cnt < k and n < 100:
      n_str = list(str(n))
      sn_t = sum(list(map(int, n_str)))
      divn_t = n / sn_t
  
      m = n + 10
      m_str = list(str(m))
      sm_t = sum(list(map(int, n_str)))
      divm_t = m / sm_t
  
      if divn_t <= divm_t:
          print(n)
          cnt += 1
  
      n = n + 10
  
  n = 99
  
  while cnt < k:
      n_str = list(str(n))
      sn_t = sum(list(map(int, n_str)))
      divn_t = n / sn_t
  
      m = n + 100
      m_str = list(str(m))
      sm_t = sum(list(map(int, m_str)))
      divm_t = m / sm_t
  
      if divn_t <= divm_t:
          print(n)
          cnt += 1
  
      n = n + 100
  
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"}]