#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <list>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <utility>
#include <complex>
#include <functional>
using namespace std;
const int MOD = 1000000007;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = (1 << 28);
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
ll k;
ll sum(ll n){
    ll sumk=0;
    while(n>0){
        sumk+=n%10;
        n/=10;
    }
    return sumk;
}
double div(ll n){
    return double(n)/sum(n);
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> k;
    vector<ll> ex;
    ll keta=1;
    for(int i=0;i<15;i++){
        for(int j=2;j<=150;j++){
            ex.push_back(keta*j-1);
        }
        keta*=10;
    }
    sort(ALL(ex));
    ex.erase(unique(ALL(ex)),ex.end());
    for(ll i=0;i<ex.size();i++){
        for(ll j=i+1;j<ex.size();j++){
            if(div(ex[j])<div(ex[i])){
                ex.erase(ex.begin()+i);
                i--
                break;
            }
        }
    }
    for(ll i=0;i<k;i++){
        cout<<ex[i]<<"\n";
    }
}