#include <bits/stdc++.h>
using namespace std;
using ll = long long;
double f(ll n) {
  auto cn = n;
  ll sn = 0;
  while (cn > 0) {
    sn += cn % 10;
    cn /= 10;
  }
  return double(n) / sn;
}
int main() {
  ll k;
  cin >> k;
  vector<ll> v;
  ll d = 1;
  for (auto i = 0; i < 15; i++) {
    for (auto j = 1; j < 150; j++) {
      v.push_back(d * (j + 1) - 1);
    }
    d *= 10;
  }
  vector<double> fv(v.size(), 0);
  for (auto i = 0; i < fv.size(); i++) fv[i] = f(v[i]);
  for (auto i = 0; i < fv.size(); i++) {
    for (auto j = i + 1; j < fv.size(); j++) {
      if (fv[i] > fv[j] || v[i] == v[j]) {
        v.erase(v.begin() + i);
        fv.erase(fv.begin() + i);
        i--;
        break;
      }
    }
  }
  for (auto i = 0; i < k; i++) cout << v[i] << endl;
  return 0;
}
