#include <bits/stdc++.h>
using namespace std;
int main() {
  int k;
  cin >> k;
  int s = 0;
  int n = 9;
  while (k > 0) {
    vector<int> aans;
    aans.push_back(n);
    int tmp = n;
    int judge = n;
    while (tmp > 0) {
      s += (tmp % 10);
      tmp /= 10;
    }
    int line = n / s;
    while (1) {
      judge -= 1;
      s -= 1;
      if (judge == 0 || s == 0) break;
      if ((judge / s) <= line) {
        aans.push_back(judge);
      } else {
        break;
      }
    }
    sort(aans.begin(), aans.end());
    for (int l = 0; l < (int)aans.size(); l++) {
      cout << aans[l] << endl;
      k--;
      if (k == 0) return 0;
    }
    n += 10;
    s = 0;
  }
}
