#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
long long A, B, C, D, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
long long ans = 0;
long long S(long long n) {
  long long res = 0;
  while (n != 0) {
    res += n % 10;
    n /= 10;
  }
  return res;
}
int main() {
  cin >> K;
  if (K <= 9)
    for (int i = 1; i <= K; i++) cout << i << endl;
  else {
    for (int i = 1; i <= 9; i++) cout << i << endl;
    K -= 9;
    ans = 19;
    int tmp = 10;
    while (K > 0) {
      if ((double)ans / S(ans) < (double)(ans + tmp) / S(ans + tmp)) {
        for (int i = 1; i <= 9; i++) {
          if (K == 0) break;
          cout << ans << endl;
          ans += tmp;
          K--;
        }
      } else {
        ans += tmp * 9;
        tmp *= 10;
      }
    }
  }
}
