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: # buf = []
  # for n in range(1000000, 2000000):
  #     s = str(n)
  #     t = sum(map(int, s))
  #     buf.append((n / t, n))
  # buf.sort()
  # tmp_max = 0
  # for v, n in buf:
  #     if tmp_max > n:
  #         continue
  #     print(n, v)
  #     tmp_max = n
  
  # n = 100000009999999
  # print(n, n / sum(map(int, str(n))))
  # n = 100000099999999
  # print(n, n / sum(map(int, str(n))))
  # n = 100000999999999
  # print(n, n / sum(map(int, str(n))))
  # n = 100009999999999
  # print(n, n / sum(map(int, str(n))))
  # n = 100099999999999
  # print(n, n / sum(map(int, str(n))))
  # n = 100999999999999
  # print(n, n / sum(map(int, str(n))))
  # n = 101999999999999
  # print(n, n / sum(map(int, str(n))))
  # n = 109999999999999
  # print(n, n / sum(map(int, str(n))))
  # n = 199999999999999
  # print(n, n / sum(map(int, str(n))))
  
  
  # print(*buf, sep='\n')
  
  
  def get_value(n):
      return int(n) / sum(map(int, n))
  
  
  def solve(k):
      d = 1
      ret = ["1", "2", "3", "4", "5", "6", "7", "8", "9"]
      while True:
          for z in range(2, 0, -1):
              t = d - z - 1
              if t < 0:
                  continue
              suffix = "9" * t
              for i in range(1, 10):
                  a = str(i) + "0" * z + suffix
                  b = str(i) + "0" * (z - 1) + "9" + suffix
                  if get_value(a) <= get_value(b):
                      for j in range(10):
                          ret.append(str(i) + "0" * (z - 1) + str(j) + suffix)
                  elif z == 1:
                      ret.append(str(i) + "9" + suffix)
  
          if len(ret) >= k:
              return ret[:k]
          d += 1
  
  
  k = int(input())
  print("\n".join(solve(k)))
  
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"}]