#include <bits/stdc++.h>

using namespace std;

#define int long long
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define bitcnt __builtin_popcount
#define SZ(x) ((ll)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
#define CINT(...)                                                              \
    int __VA_ARGS__;                                                           \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    ll __VA_ARGS__;                                                            \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v)                                                              \
    {                                                                          \
        FOREACH(x, v) { cout << x << " "; }                                    \
        cout << "\n";                                                          \
    }
template <typename T = string> inline void eputs(T s) {
    cout << s << "\n";
    exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;

typedef long long ll;
typedef unsigned long long ul;
typedef vector<ll> VL;
typedef pair<ll, ll> PL;

const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18 + 1;
const ll dx[] = {1, -1, 0, 0};
const ll dy[] = {0, 0, 1, -1};

ll K;

ll mypow(ll x, ll n) {
    ll res = 1;
    while(n > 0) {
        if(n & 1) res = res * x;
        x *= x;
        n >>= 1;
    }
    return res;
}

ll digsum(ll x) {
    ll ret = 0;
    while(x > 0) {
        ret += x % 10;
        x /= 10;
    }
    return ret;
}

ll increment(ll x) {
    PQG<pair<double, ll>> pqg;
    ll dig = to_string(x).length();
    double m = LINF;
    REP(d, dig + 1) REP(i, 10) {
        string s;
        if(dig - d - 1 >= 0) s += to_string(x).substr(0, dig - d - 1);
        s += to_string(i);
        s += string(d, '9');
        ll v = stoll(s);
        if(v > x) {
            pqg.emplace(v * 1.0 / digsum(v), v);
            // m = min(v * 1.0 / digsum(v), m);
        }
        // cout << v << " " << v * 1.0 / digsum(v) << " " << m << "\n";
    }
    if(dig - 2 >= 0) {
        REP(i, 1000) {
            ll v = stoll(to_string(i) + string(dig - 2, '9'));
            if(v > x) {
                pqg.emplace(v * 1.0 / digsum(v), v);
                // m = min(v * 1.0 / digsum(v), m);
            }
            // cout << v << " " << v * 1.0 / digsum(v) << " " << m << "\n";
        }
    }
    return pqg.top().second;
}

signed main() {
    cin >> K;
    ll now = 1;
    REP(loop, K) {
        cout << now << "\n";
        now = increment(now);
    }
}


Measured memory_bytes: 256