K = int(input())
import numpy as np
def sumn(num):
    return num // sum(list(map(int, str(num))))

a,b = [],[]
for i in range(16):
    for j in range(1,10):
        a.append(int(str(j)+"9"*i))
for i in range(1,16):
    for j in range(10,1001):
        a.append(int(str(j)+"9"*i))
a = np.sort(np.unique(np.array(a)))
v = np.vectorize(sumn)
b = v(a)


n = 0
while True:
    for i in range(len(b)):
        if np.min(b[i:]) >= b[i]:
            print(a[i])
            n += 1
            if n == K: exit()

