#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;

#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF=1e18+18;
const ll MAX=100005;
const ll MOD=1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgarr(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n,arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#define sum(v) accumulate(ALL(v),0)
#define fi first
#define se second
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())


template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }

template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }

// vector
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
    int len=v.size();
    for(int i=0; i<len; ++i) {
        s<<v[i];
        if(i<len-1) s<<"	";
    }
    return s;
}

// 2 dimentional vector
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
    int len=vv.size();
    for(int i=0; i<len; ++i) {
        s<<vv[i]<<endl;
    }
    return s;
}

ll keta(ll n){
    ll res = 0;
    while(n){
        res += n%10;
        n /= 10;
    }
    return res;
}

void simulate(){
    ll start = 1099999;
    ll trycnt = 10000000;
    ll checkcnt = 1000000;
    REP(i,start,start+trycnt){
        bool ok = true;
        rep(j,checkcnt){
            ll x = i+j;
            if(i*keta(x) > keta(i)*x){
                ok = false;
                break;
            }
        }
        if(ok){
            dbg(i);
        }
    }
    exit(0);
}

void simulate2(){
    ll loop = 1000;
    ll trycnt = 15;
    REP(j,1, loop){
        ll start = j;
        ll next = start+1;
        if(start%10==9)continue;
        rep(i,trycnt){
            if(start * keta(next) <= keta(start)*next){
                dbg(j);
                dbg(start);
                break;
            }
            start*=10;
            start+=9;
            next*=10;
            next+=9;
        }
    }
    exit(0);

}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<std::setprecision(10);

    //simulate();
    //simulate2();
    ll k;
    cin>>k;
    Vec snuke;
    ll loop = 1000;
    ll trycnt = 15;
    REP(j,1, loop){
        ll start = j;
        ll next = start+1;
        if(start%10==9)continue;
        rep(i,trycnt){
            if(start * keta(next) <= keta(start)*next){
                while (start < 1e16){
                    snuke.pb(start);
                    start*=10;
                    start+=9;
                }
                break;
            }
            start*=10;
            start+=9;
            next*=10;
            next+=9;
        }
    }
    ll start = 9;
    while (start < 1e17){
        snuke.pb(start);
        start*=10;
        start+=9;
    }
    sort(ALL(snuke));
    //ll x = snuke.size();
    //dbg(snuke)
    //Uniq(snuke);
//    ll y = snuke.size();
//    assert(x==y);
    rep(i,k){
        cout<<snuke[i]<<endl;
    }
    return  0;
}


Measured memory_bytes: 256