#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
long long K;
long long ans = 0;
vector<long long> anss;
vector<double> onee;
vector<double> twoo;
double s_n(long long x) {
  double sum = 0;
  while (x > 0) {
    double lastdigit = x % 10;
    sum += lastdigit;
    x /= 10;
  }
  return sum;
}
bool test(double x) {
  double one = x / s_n(x);
  onee.push_back(one);
  double two = (x + 10.0) / s_n(x + 10);
  twoo.push_back(two);
  if (one < two) {
    return true;
  } else {
    return false;
  }
}
int main() {
  high_resolution_clock::time_point t1 = high_resolution_clock::now();
  cin >> K;
  if (K <= 9) {
    for (int i = 1; i <= K; i++) {
      cout << i << '\n';
    }
    return 0;
  } else {
    for (int i = 1; i <= 9; i++) {
      cout << i << '\n';
    }
    K -= 9;
  }
  long long curr = 19;
  long long bound = 100;
  while (anss.size() < K) {
    if (test(curr)) {
      while (curr < bound) {
        anss.push_back(curr);
        curr += 10;
      }
    }
    bound *= 10;
  }
  for (int i = 0; i < K; i++) {
    cout << anss[i] << '\n';
  }
  return 0;
}
