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 Ruby (2.3.3) (judge verdict: Time Limit Exceeded)

k = gets.to_i

def is_snuke(n)
    s = 0
    m = n
    while m > 0
        s += m % 10
        m /= 10
    end
    n / s == 1
end

i = 1
cnt = 0
while cnt < k do
    if is_snuke(i)
        cnt += 1
        puts i
    end
    i += 1
end