#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using ld = long double;
int main(void) {
  lint k;
  cin >> k;
  auto S = [](lint n) -> lint {
    lint ret = 0;
    while (n > 0) {
      ret += (n % 10);
      n /= 10;
    }
    return ret;
  };
  auto mypow = [](lint a, lint b) -> lint {
    lint ans = 1;
    for (lint I = 0; (I) < (lint)(b); ++(I)) {
      ans *= a;
    }
    return ans;
  };
  set<lint> source;
  for (lint i = 0; (i) < (lint)(16); ++(i)) {
    for (lint j = (1); (j) <= (lint)(999); ++(j)) {
      lint t = j * mypow(10, i) + mypow(10, i) - 1;
      source.insert(t);
    }
  }
  vector<pair<lint, double>> v;
  for (auto &e : source) {
    v.push_back(make_pair(e, (double)e / S(e)));
  }
  sort(v.begin(), v.end(), [](pair<lint, double> a, pair<lint, double> b) {
    if (a.second != b.second) {
      return a.second < b.second;
    } else {
      return a.first < b.first;
    }
  });
  lint t = 0;
  for (lint i = 0; (i) < (lint)(k); ++(i)) {
    if (t < v[i].first) {
      cout << v[i].first << endl;
      t = v[i].first;
    }
  }
}
