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())
  
  
  def snuke(N):
      S = list(str(N))
      SN = 0
      for i in S:
          SN += int(i)
      return N / SN
  
  
  def X(D, n):
      temp = (n + 10 ** (D + 1)) // (10 ** (D + 1))
      return 10 ** (D + 1) * temp - 1
  
  
  L = [1]
  k = 1
  for i in range(1, K):
      N = L[k - 1] + 1
      x = X(0, N)
      tmp = snuke(N)
      ans = N
      for d in range(len(str(N))):
          x = X(d, N)
          if snuke(x) < tmp:
              tmp = snuke(x)
              ans = x
      L.append(ans)
      k += 1
  for i in L:
      print(i)
  
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"}]