#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define p pair<double, ll>
template<class T> void chmin(T& x, T y){if(x > y) x = y;}
template<class T> void chmax(T& x, T y){if(x < y) x = y;}

ll K;

int S(ll x){
    int res = 0;
    for(int i = 0; i < 20; i++){
        res += x % 10;
        x /= 10;
    }
    return res;
}

db g(ll x){
    return (db)x / (db)S(x);
}

ll snuke(ll x){
    priority_queue<p, vector<p>, greater<p>> pq;
   ll md = 1;
    while((x * 10) % md != x * 10){
        ll t = x - (x % md) + md - 1;
        pq.push({g(t), t});
        md *= 10;
    }
    return pq.top().second;
}

int main(){
    cin >> K;
    ll idx = 1;
    for(int i = 0; i < K; i++){
        cout << idx << endl;
        idx = snuke(idx + 1);
    }
    return 0;
}