/**
 *    author:  zjsdut
 *    created: 2020/01/18 11:19:55
**/
#include <bits/stdc++.h>

using namespace std;

struct fast_ios {
    fast_ios() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    };
} fast_ios_;

template<typename A, typename B>
bool chkmin(A &a, const B &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename A, typename B>
bool chkmax(A &a, const B &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
istream &operator>>(istream &stream, vector<T> &vec) {
    for (auto &x : vec) stream >> x;
    return stream;
}

void scan() {}

template<class T, class ...Args>
void scan(T &a, Args &...rest) {
    cin >> a;
    scan(rest...);
}

using ll = long long;
using vl = vector<ll>;
using vb = vector<bool>;
using vi = vector<int>;
using pii = pair<int, int>;
template<typename T> using vv = vector<vector<T>>;
#define rng(i, a, b) for(int i = (int)(a); i < (int)(b); ++i)
#define up(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define down(i, b, a) for (int i = int(b); i >= int(a); i--)
#define rep(n) for(int _iter_##n = 0, _num_##n = (int)n; _iter_##n < _num_##n; ++_iter_##n)
#define FOR(x, cont) for (const auto &x: cont)
#define For(x, cont) for (auto &x: cont)
#define all(x) begin(x), end(x)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ep emplace
#define SZ(x) (int)(x).size()
#define UNIQ(vec) (vec).erase(unique(all(vec)), end(vec))
#define LB(cont, x) int(lower_bound(all(cont), x) - begin(cont))
#define UB(cont, x) int(upper_bound(all(cont), x) - begin(cont))

template<typename T>
ostream &operator<<(ostream &stream, const vector<T> &vec) {
    if (!vec.empty()) {
        stream << vec[0];
        for (size_t i = 1; i != vec.size(); ++i)
            stream << ' ' << vec[i];
    }
    return stream;
}

template<typename T>
void print(const vector<T> &t) { cout << t << '\n'; }

template<typename T>
void print(const vector<vector<T>> &t) {
    for (const auto &row : t) {
        print(row);
    }
}

template<typename T>
void print(const T &t) { cout << t << ' '; }

template<typename T, typename ...Args>
void print(const T &t, const Args &...rest) {
    print(t);
    print(rest...);
}

template<typename T>
void println(const T &t) { cout << t << '\n'; }

template<typename T, typename ...Args>
void println(const T &t, const Args &...rest) {
    print(t);
    println(rest...);
}

struct Frac {
        ll p, q;
};
bool operator<(const Frac& a, const Frac& b) {
    return  a.p * b. q < a.q * b.p;
}

int main() {
#if defined LOCAL
    ifstream in("in.txt");
    cin.rdbuf(in.rdbuf());
#endif
    int K;
    scan(K);
    if (K <= 9) {
        up (i, 1, K) {
            println(i);
        }
        return 0;
    }
    up (i, 1, 9) {
        println(i);
    }
    K -= 9;
    ll n = 10;
    for (int i = 0; i < K; ++i) {
        ll m = n;
        vi digits;
        while (m > 0) {
            digits.pb(m % 10);
            m /= 10;
        }
        if (accumulate(all(digits), 0) == 9 * SZ(digits)) {
            println(n);
            ++n;
            continue;
        }
        reverse(all(digits));
        auto toll = [](const vi& d) {
            ll res = 0;
            FOR (x, d) {
                res *= 10;
                res += x;
            }
            return res;
        };
        vector<pair<Frac, ll>> cand;
        // cand.push_back({{n, accumulate(all(digits), 0)}, n});
        rng (j, 0, SZ(digits)) {
            if (digits[j] == 9) continue;
            vi tmp = digits;
            rng (k, j, SZ(digits)) {
                tmp[k] = 9;
            }
            ll val = toll(tmp);
            ll sum = accumulate(all(tmp), 0);
            cand.push_back({{val, sum}, val});
        }
        sort(all(cand));
        auto p = cand.front().first;
        if (p < Frac{n, accumulate(all(digits), 0)}) {
            n = p.p;
            println(n);
            ++n;
        }
        else {
            println(n);
            ++i;
            if (i < K) {
                n = p.p;
                println(n);
                ++n;
            }
        }
    }
    return 0;
}


Measured memory_bytes: 256