#include <bits/stdc++.h>
using namespace std;
long long S(long long n) {
  long long ret = 0;
  while (n > 0) {
    ret += n % 10;
    n /= 10;
  }
  return ret;
}
void solve(int K) {
  vector<long long> kk = {1, 2, 3, 4, 5, 6, 7, 8, 9};
  long long base = 1;
  long long right = 9;
  for (int i = 0; i < 15; i++) {
    for (int j = 1; j < 10; j++) {
      long long n = j * base * 10 + right;
      kk.push_back(n);
      long long s = S(n);
      double f = (double)n / (double)s;
    }
    base *= 10;
    right = right * 10 + 9;
  }
  for (int i = 0; i < K; i++) {
    printf("%lld\n", kk[i]);
  }
}
int main() {
  int K;
  cin >> K;
  solve(K);
  return 0;
}
