#include <bits/stdc++.h>
using namespace std;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
long long gcd(long long n, long long m) { return (m ? gcd(m, n % m) : n); }
long long lcm(long long n, long long m) { return n / gcd(n, m) * m; }
long double dig(long long n) {
  long double ans = 0;
  while (n > 0) {
    ans += n % 10;
    n /= 10;
  }
  return ans;
}
int main() {
  int k;
  cin >> k;
  vector<long long> ans;
  long double c = 1000000000000000009;
  for (long long i = 999999999999999; i >= 999999999999; i -= 1000000000) {
    long double d = (long double)i / dig(i);
    if (c + 1e-10 >= d) {
      ans.push_back(i);
      c = d;
    }
  }
  for (long long i = 999999999999; i >= 999999999; i -= 1000000) {
    long double d = (long double)i / dig(i);
    if (c + 1e-10 >= d) {
      ans.push_back(i);
      c = d;
    }
  }
  for (long long i = 999999999; i >= 999999; i -= 1000) {
    long double d = (long double)i / dig(i);
    if (c + 1e-10 >= d) {
      ans.push_back(i);
      c = d;
    }
  }
  for (long long i = 999999; i >= 1; i--) {
    long double d = (long double)i / dig(i);
    if (c + 1e-10 >= d) {
      ans.push_back(i);
      c = d;
    }
  }
  reverse(ans.begin(), ans.end());
  for (int i = 0; i < k; i++) {
    cout << ans[i] << endl;
  }
}
