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: L = list()
  N = int(input())
  for i in range(1, N + 1):
      s = i // 9
      t = i % 9
      L.append(((t + 1) * pow(10, s)) - 1)
  for i in range(2, 19):
      for j in range(1, 10):
          for s in range(1, min(10, i)):
              L.append((s * 10 + j) * pow(10, i) - 1)
  L = sorted(list(set(L)))
  for i in range(N):
      print(L[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"}]