#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vector<T>>;
template <class T>
inline bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, const T& b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
void init() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
}
const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
ll dig(ll a) {
  ll ret = 0;
  while (a) {
    a /= 10;
    ret++;
  }
  return ret - 1;
}
ll dsum(ll a) {
  ll ret = 0;
  while (a) {
    ret += a % 10;
    a /= 10;
  }
  return ret;
}
int main() {
  init();
  ll K;
  cin >> K;
  vl cand;
  ll P = 150, ps = 1;
  for (ll i = 0; i < (16); i++) {
    for (ll x = (1); x < (min(ps * 10, P)); x++) {
      ll a = x;
      for (ll _ = 0; _ < (i - dig(a)); _++) a *= 10, a += 9;
      cand.emplace_back(a);
    }
    ps *= 10;
  }
  sort((cand).begin(), (cand).end());
  cand.erase(unique((cand).begin(), (cand).end()), cand.end());
  ll cn = cand.size();
  vc<ld> E(cn);
  vc<bool> B(cn, true);
  for (ll i = 0; i < (cn); i++) {
    E[i] = (ld)cand[i] / dsum(cand[i]);
  }
  for (ll i = (cn - 1) - 1; i >= 0; i--) {
    if (chmin(E[i], E[i + 1])) B[i] = false;
  }
  ll cnt = 0;
  for (ll i = 0; i < (cn); i++) {
    if (B[i]) {
      cout << cand[i] << '\n';
      cnt++;
    }
    if (cnt == K) break;
  }
}
