Problem:
Score : 500 points

Problem 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.

Constraints

1 \leq K

The K-th smallest Snuke number is not greater than 10^{15}.

Input

Input is given from Standard Input in the following format:

K

Output

Print K lines. The i-th line should contain the i-th smallest Snuke number.

Sample Input 1

10

Sample Output 1

1
2
3
4
5
6
7
8
9
19

Solution in Kotlin (1.0.0) (judge verdict: Wrong Answer)

import java.util.Scanner

fun main(args: Array<String>) {
  val scanner = Scanner(System.`in`)
  var K = scanner.nextInt()
  scanner.close()



  var long = 0L
  var i = 0

  var head:Short = 0
  var foot = 0

  for (int in 1..K) {
    head++
    if (head == 10.toShort()) {
      head = 1
      foot++
    }
    println(head.toString() + footer(foot))
  }
  return

  while (true) {
    long++
    if (long / sum(long) <= (long + 1) / sum(long + 1)) {
      println(long)
      i++
    }
    if (i == K) {
      break
    }
  }


}

private fun footer(int: Int) : String {
  var ans = ""
  var i = 0
  while (int > i) {
    ans += "9"
    i++
  }
  return  ans
}

private fun sum(long: Long) : Long {
  var sum = 0L
  for (char in long.toString().toCharArray()) {
    sum += char.toString().toLong()
  }
  return sum
}