#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll digit_sum(ll n) {
  ll res = 0;
  while (n) {
    res += n % 10LL;
    n /= 10LL;
  }
  return res;
}
ll next_snuke(ll n) {
  ll now = n + 1;
  ll base = 1;
  ll smallest = n + 1;
  ll d_sum = digit_sum(smallest);
  while (true) {
    ll check = (now / base) % 10L;
    if (check != 9) {
      now += base;
      ll d_sum_now = digit_sum(now);
      if (now * d_sum < smallest * d_sum_now) {
        smallest = now;
        d_sum = d_sum_now;
      }
      if (check == 8) base *= 10;
    } else
      base *= 10;
    if (now > 100 * n) break;
  }
  return smallest;
}
int main() {
  ll k;
  cin >> k;
  for (int i = (1); i < (10); i++)
    if (i <= k) cout << i << endl;
  k = max(0LL, k - 9);
  ll snuke = 9;
  while (k) {
    snuke = next_snuke(snuke);
    cout << snuke << endl;
    --k;
  }
  return 0;
}
