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: # -*- coding: utf-8 -*-
  import bisect
  import heapq
  import math
  import random
  import sys
  from collections import Counter, defaultdict
  from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
  from functools import lru_cache, reduce
  from itertools import combinations, combinations_with_replacement, product, permutations
  
  sys.setrecursionlimit(10000)
  
  
  def read_int():
      return int(input())
  
  
  def read_int_n():
      return list(map(int, input().split()))
  
  
  def read_float():
      return float(input())
  
  
  def read_float_n():
      return list(map(float, input().split()))
  
  
  def read_str():
      return input()
  
  
  def read_str_n():
      return list(map(str, input().split()))
  
  
  def error_print(*args):
      print(*args, file=sys.stderr)
  
  
  def mt(f):
      import time
  
      def wrap(*args, **kwargs):
          s = time.time()
          ret = f(*args, **kwargs)
          e = time.time()
  
          error_print(e - s, "sec")
          return ret
  
      return wrap
  
  
  def S(n):
      s = 0
      while n != 0:
          s += n % 10
          n //= 10
      return s
  
  
  # @mt
  def slv(K):
      ans = [(i, i / S(i)) for i in range(1, 10)]
      for i in range(16):
          a = i
          if a > 4:
              a = 4
          for j in range(1, 10**a):
              b = (10 ** (i - a + 1)) * j + (10 ** (i - a + 1) - 1)
              if b < 10 ** (i - 1):
                  continue
              s = S(b)
  
              while ans[-1][1] > b / s or ans[-1][0] == b:
                  (ans.pop())
              ans.append((b, b / s))
              # print(ans[-1])
      # error_print(len(ans))
      # for r in ans:
      #     error_print(r)
      error_print(len(ans))
  
      return "\n".join(map(str, map(lambda x: x[0], ans[:K])))
  
  
  def main():
      K = read_int()
      print(slv(K))
  
  
  if __name__ == "__main__":
      main()
  
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"}]