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)

def pp(one, two, qu):
    ans = ""
    if one == 0:
        ans += str(two)
    else:
        ans += str(one)
        ans += str(two)
    for i in range(qu):
            ans += "9"
    print(ans)
    

K = int(input())
su = [1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 29, 39, 49, 59, 69, 79, 89, 99]
i = 0
while K > i:
    if i == 18:
        break
    print(su[i])
    i += 1
qu = 2
one = 0
two = 1
K -= 18
while(K > 0):
    pp(one, two, qu)
    K -= 1
    if two == 9:
        if one + 1 < qu:
            one += 1
            two = 0
        else:
            two = qu
            one = 0
            qu += 1
    else:
        two += 1