#include <bits/stdc++.h>
using namespace std;
int solve(long long x) {
  int rep = 0;
  while (x > 0) {
    rep += x % 10;
    x /= 10;
  }
  return rep;
}
int main() {
  int k;
  cin >> k;
  long long n = 0;
  long long m;
  for (int i = 0; i < k; i++) {
    n++;
    m = n;
    for (int d = 0; d < 15; d++) {
      if (pow(10, d) > n) break;
      for (long long s = (long long)(n / pow(10, d));
           s < (long long)((n / pow(10, d + 1)) + 1) * (pow(10, d + 1)); s++) {
        if (1.0f * ((s + 1) * pow(10, d) - 1) /
                solve((long long)((s + 1) * pow(10, d) - 1)) <
            1.0f * m / solve(m)) {
          m = (long long)((s + 1) * pow(10, d) - 1);
        }
      }
    }
    n = m;
    cout << n << endl;
  }
}
