#include <bits/stdc++.h>
using namespace std;
int K;
int S(long long N) {
  if (N < 10) return N;
  return (N % 10) + S(N / 10);
}
long long f(long long N) {
  vector<pair<long long, long long>> res;
  res.push_back(pair<long long, long long>(N / S(N), N));
  for (long long m = 10; m <= N * 10; m *= 10) {
    long long k = m * (N / m + 1) - 1;
    res.push_back(pair<long long, long long>(k / S(k), k));
  }
  sort(res.begin(), res.end());
  return res[0].second;
}
int main() {
  cin >> K;
  long long N = 1;
  for (int i = 0; i < (int)K; i++) {
    printf("%lld\n", N);
    N = f(N + 1);
  }
  return 0;
}
