K = gets.to_i

def calc(a)
    n = 0
    a.to_s.each_char{|x| n += x.to_i}
    return (a.to_f / n.to_f)
end

def solve(cnt, digits, now)
    return 0 if cnt >= K
    puts (now.to_s) + ("9" * (digits-1))
    if now == 9
        solve(cnt + 1, digits + 1, 1)
    else
        solve(cnt + 1, digits, now + 1)
    end
end

if K < 10
    (K-1).times{ |x|
        puts (x+1)
    }
else
    9.times{ |x|
        puts (x+1)
    }
    solve(9,2,1)
end
