#include <bits/stdc++.h>
using namespace std;
bool sortinrev(const pair<long long int, long long int> &a,
               const pair<long long int, long long int> &b) {
  return (a.first > b.first);
}
float sum(int a) {
  float res = 0.00;
  while (a != 0) {
    res += a % 10;
    a /= 10;
  }
  return res;
}
int arr[1000000] = {0};
int main() {
  int k;
  cin >> k;
  vector<long long int> v;
  for (int i = 1; i <= 9; i++) {
    v.push_back(i);
  }
  for (int i = 19; i <= 99; i += 10) {
    v.push_back(i);
  }
  for (int i = 19; i <= INT_MAX; i += 9) {
    if (v.size() >= k) break;
    for (int j = 0; j < i; j++) {
      v.push_back(v[v.size() - 1] + pow(10, ((i - 10) / 9 + 1)));
      if (v.size() >= k) break;
    }
  }
  for (int i = 0; i < k; i++) {
    cout << v[i] << '\n';
  }
}
