#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T>
using vec = vector<T>;
template <class T>
using vvec = vector<vec<T>>;
constexpr long long INF = 1LL << 60;
constexpr int INF_INT = 1 << 25;
constexpr long long MOD = (ll)1e9 + 7;
using ld = long double;
static const ld pi = 3.141592653589793L;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
struct Edge {
  ll to, rev;
  long double cap;
  Edge(ll _to, long double _cap, ll _rev) {
    to = _to;
    cap = _cap;
    rev = _rev;
  }
};
using Edges = vector<Edge>;
using Graph = vector<Edges>;
void add_edge(Graph& G, ll from, ll to, long double cap, bool revFlag,
              long double revCap) {
  G[from].push_back(Edge(to, cap, (ll)G[to].size()));
  if (revFlag) G[to].push_back(Edge(from, revCap, (ll)G[from].size() - 1));
}
void solve() {
  ll k;
  cin >> k;
  auto snuke = [&](int x) -> double {
    int y = x;
    int s = 0;
    while (y) {
      s += y % 10;
      y /= 10;
    }
    return (double)x / (double)s;
  };
  ll num = 0;
  ll diff = 1;
  while (k > 0) {
    while (true) {
      num += diff;
      cout << num << '\n';
      k--;
      if (k <= 0) break;
      ll x = (num / diff) % 10;
      if (x == 9) {
        break;
      }
    }
    if (k <= 0) break;
    if (snuke(diff * 10 + num) >= snuke(diff + num)) {
      num += diff;
      cout << num << '\n';
      k--;
      continue;
    }
    while (snuke(diff * 10 + num) < snuke(diff + num)) diff *= 10;
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}
