#include <bits/stdc++.h>
#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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll mod2 = 998244353;
const ll INF = 1e18;
const long double EPS = 1e-10;

ll getsn(ll n) {
  ll sn = 0;
  while (n > 0) {
    sn += n % 10;
    n /= 10;
  }
  return sn;
}

int main() {
  ll k;
  cin >> k;
  
  ll ans = 1;
  for (ll i = 0, d = 1; i < k; i++) {
    cout << ans << endl;

    while ((ans + d - 1) / getsn(ans + d) >= d) {
      d *= 10;
    }
    ans += d;
  }


  
  return 0;
}