#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = (1 << 28);
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
          Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
long long k;
long long sum(long long n) {
  long long sumk = 0;
  while (n > 0) {
    sumk += n % 10;
    n /= 10;
  }
  return sumk;
}
long long div(long long n) { return double(n) / sum(n); }
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> k;
  vector<long long> ex;
  long long keta = 1;
  for (int i = 0; i < 15; i++) {
    for (int j = 2; j <= 150; j++) {
      ex.push_back(keta * j - 1);
    }
    keta *= 10;
  }
  sort(ex.begin(), ex.end());
  ex.erase(unique(ex.begin(), ex.end()), ex.end());
  for (long long i = 0; i < ex.size(); i++) {
    for (long long j = i + 1; j < ex.size(); j++) {
      if (div(ex[j]) < div(ex[i])) {
        ex.erase(ex.begin() + i--);
        break;
      }
    }
  }
  for (long long i = 0; i < k; i++) {
    cout << ex[i] << "\n";
  }
}
