#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
double s(long long n)
{
    long long x=n;
    long long y=0;
    while (x)
    {
        y+=x%10;
        x/=10;
    }
    return (double)n/y;
}
int main()
{
    long long K;
    long long n=1;
    long long x=1;
    scanf("%lld",&K);
    for (int i = 0; i < K; i++)
    {
        printf("%lld\n",n);
        if (s(n+x)>s(n+x*10))
            x*=10;
        n+=x;
    }
    return 0;
}