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)

K = int(input())
#
# for i in ragen(1, K + 1):
#     if i < 10:
#         print(i)
#     elif i <



for i in range(1, K + 1):
    moji = ''
    margin = i % 9
    sho = i // 9
    if i > 27:
        j = i - 28 + 10
        jamari = j // 99
        moji += str((i - 28 + 10) % 99)
        for k in range(jamari):
            moji += '9'
        moji += str(99)

    elif margin == 0:
        for j in range(sho):
            moji += '9'
    else:
        moji += str(i % 9)
        for j in range(sho):
            moji += '9'
    print(int(moji))