#include <bits/stdc++.h>
using namespace std;
template <class T>
void chmin(T& x, T y) {
  if (x > y) x = y;
}
template <class T>
void chmax(T& x, T y) {
  if (x < y) x = y;
}
long long K;
int S(long long x) {
  int res = 0;
  for (int i = 0; i < 20; i++) {
    res += x % 10;
    x /= 10;
  }
  return res;
}
double g(long long x) { return (double)x / (double)S(x); }
long long snuke(long long x) {
  priority_queue<pair<double, int>, vector<pair<double, int>>,
                 greater<pair<double, int>>>
      pq;
  long long md = 1;
  while (x % (md / 10) != x) {
    long long t = x - (x % md) + md - 1;
    pq.push({g(t), t});
    md *= 10;
  }
  return pq.top().second;
}
int main() {
  cin >> K;
  long long idx = 1;
  for (int i = 0; i < K; i++) {
    cout << idx << endl;
    idx = snuke(idx + 1);
  }
  return 0;
}
