#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>

using namespace std;

long long s(long long n) {
    long long ans = 0;

    while (n) {
        ans += n % 10;
        n /= 10;
    }

    return ans;
}

long long f(long long n) {
    long long d = 0, tmp = n;
    while (tmp) {
        tmp /= 10;
        d++;
    }

    long long x, ans = n;
    // cout << ans << endl;
    for (int i = 0; i < d; i++) {
        x = (long long)(pow(10, i+1)) * (n / (long long)(pow(10, i+1)) + 1) - 1;
        // cout << x << endl;
        if (x * s(ans) < ans * s(x)) {
            ans = x;
        }
    }

    return ans;
}

int main() {
    int k;
    cin >> k;
    long long n = 1;
    cout << n << endl;
    for (int i = 1; i < k; i++) {
        cout << f(n+1) << endl;
        n = f(n+1);
    }
    // cout << f(12345) << endl;
}
