#include <bits/stdc++.h>
using namespace std;
long long s(long long n) {
  int tmp = n;
  int res = 0;
  while (1) {
    res += tmp % 10;
    tmp /= 10;
    if (tmp == 0) {
      break;
    }
  }
  return res;
}
int main() {
  long long k;
  long long n, m;
  pair<long long, long long> p[1000000000];
  m = 100000000000000;
  cin >> k;
  int cnt = 0;
  for (long long i = 1; i < 1000000000; i++) {
    int tmp = i / s(i);
    if (tmp <= m) {
      p[i].first = (tmp > 0) ? tmp : m;
      p[i].second = i;
    }
  }
  sort(p, p + 1000000000);
  for (int i = 1; i <= k; i++) {
    cout << p[i].second << endl;
  }
}
