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 Python (3.4.3) (judge verdict: Wrong Answer)

n = int(input())
i = 0
temp = 99
count = 2
while i < n:
    if i <9:
        print(i+1)
    elif i < 18:
        print(9+10*(i-8))
    elif count >2:
        for j in range(90):
            i+=1
            if i>=n:
                break
            temp+=(10**count)
            print(temp)
        count+=1
    else:
        for j in range(99):
            i+=1
            if i>=n:
                break
            temp+=(10**count)
            print(temp)
        count+=1

    i+=1