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: Time Limit Exceeded)

"""
すぬけ
"""
import math
def sn(i):
    tmp = i % 10
    sn = tmp
    tmp1 = math.floor(i/10)
    while tmp1 > 0:
        tmp = tmp1 % 10
        sn += tmp
        tmp1 = math.floor(tmp1/10)
    return sn

def hantei(i):

    while i > 9:
        tmp = i % 10
        if tmp != 9:
            return False
        i = math.floor(i/10)
    return True

list  = []
k = int(input())
max = 0
i = 0
cnt = 1
while i != k:
    """
一桁なら全部
n桁ならn-1桁全部9の数が下から採用
    """
    if math.floor(cnt / 10) == 0:
        list.append(cnt)
        i += 1
    elif hantei(cnt):
        list.append(cnt)
        i += 1
    cnt += 1


for i in list:
    print(i)