K = int(input())

def S(number):
    return sum([int(i) for i in str(number)])

def find_sunuke():
    found = 0
    n = 1

    while True:
        for m in range(n+1, n+2):
            if n/S(n) <= m/S(m):
                print(n)
                found += 1
                if found == K:
                    return
                break
        n += 1

find_sunuke()
