#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using ll = long long;
const int MOD = 1e9 + 7;
int main() {
  vector<double> v(9 * 15), m(9 * 15);
  vector<ll> ret(9 * 15);
  for (int i = 1; i <= 9 * 15; i++) {
    int a = i;
    ret[i - 1] = a % 9;
    a -= ret[i - 1];
    for (int j = 0; j < a / 9; j++) {
      ret[i - 1] = ret[i - 1] * 10 + 9;
    }
    v[i - 1] = (double)ret[i - 1] / (double)i;
  }
  m[9 * 15 - 1] = v[9 * 15 - 1];
  for (int i = 9 * 15 - 2; i >= 0; i--) {
    m[i] = min(v[i], m[i + 1]);
  }
  int k;
  cin >> k;
  for (int i = 0; i < 9 * 15; i++) {
    if (v[i] != m[i]) continue;
    cout << ret[i] << endl;
    k--;
    if (k == 0) break;
  }
}
