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: Wrong Answer)

# https://atcoder.jp/contests/abc101/tasks/arc099_b


K = gets.to_i
if K<=9
    (1..K).each do |i|
        puts i
    end
    exit
end

(1..9).each do |i|
    puts i
end
k=9
i=1
keta=1
while k<K
    #p "#{keta},#{i}"
    if i<keta*10
        print i
        i+=1
        keta.times do
            print 9
        end
        if i==keta*10
            i+=9
        end       
    else
        print i
        keta.times do
            print 9
        end       
        if i%9==0
            keta+=1
            i=10
        else
            i+=10
        end
    end
    puts ""
    k+=1
end