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 Julia (0.5.0) (judge verdict: Wrong Answer)

function nsn(x)
    s=dec(x)
    n=parse(s)
    sn=sum(x->x-'0',s)
    n / sn
end

function main()
    k = readline() |> parse
    for x=1:min(81,k)
        n = x % 9
        if n == 0
            n = 9
        end
        keta = cld(x, 9) - 1
        println(n, repeat("9",keta))
    end
    for x=1:(k-81)
        println(x, repeat("9",9))
    end
end

main()