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: a = [
      "1",
      "2",
      "3",
      "4",
      "5",
      "6",
      "7",
      "8",
      "9",
      "19",
      "29",
      "39",
      "49",
      "59",
      "69",
      "79",
      "89",
      "99",
      "199",
      "299",
      "399",
      "499",
      "599",
      "699",
      "799",
      "899",
      "999",
  ]
  b = [
      "1099",
      "1199",
      "1299",
      "1399",
      "1499",
      "1599",
      "1699",
      "1799",
      "1899",
      "1999",
      "2099",
      "2199",
      "2299",
      "2399",
      "2499",
      "2599",
      "2699",
      "2799",
      "2899",
      "2999",
      "3099",
      "3199",
      "3299",
      "3399",
      "3499",
      "3599",
      "3699",
      "3799",
      "3899",
      "3999",
      "4099",
      "4199",
      "4299",
      "4399",
      "4499",
      "4599",
      "4699",
      "4799",
      "4899",
      "4999",
      "5099",
      "5199",
      "5299",
      "5399",
      "5499",
      "5599",
      "5699",
      "5799",
      "5899",
      "5999",
      "6099",
      "6199",
      "6299",
      "6399",
      "6499",
      "6599",
      "6699",
      "6799",
      "6899",
      "6999",
      "7099",
      "7199",
      "7299",
      "7399",
      "7499",
      "7599",
      "7699",
      "7799",
      "7899",
      "7999",
      "8099",
      "8199",
      "8299",
      "8399",
      "8499",
      "8599",
      "8699",
      "8799",
      "8899",
      "8999",
      "9099",
      "9199",
      "9299",
      "9399",
      "9499",
      "9599",
      "9699",
      "9799",
      "9899",
      "9999",
  ]
  k = int(input())
  if k <= 27:
      for i in range(k):
          print(a[i])
  else:
      for s in a:
          print(s)
      cnt = 28
      num = 0
      while True:
          for i in range(90):
              print(b[i] + "9" * num)
              cnt += 1
              if k < cnt:
                  break
          num += 1
          if k < cnt:
              break
  
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"}]