from heapq import *
def snu(n):
    s=str(n)
    kei=sum(int(x) for x in s)
    return n/kei
k=int(input())
hp=[]
t=9 if k>9 else k
for i in range(1,t+1):
    print(i)
if k<=9:exit()
for i in range(1,15):
    n=10**i+9
    heappush(hp,[n/10,n])
ans=[]
for _ in range(k-9):
    s,n=heappop(hp)
    print(n)
#    ans.append([s,n])
    iti=n%10
    if iti==9:
        heappush(hp,[snu(n+10),n+10])
        heappush(hp, [snu(n-1), n-1])
    elif iti>0:
        heappush(hp, [snu(n - 1), n - 1])
