#include <bits/stdc++.h>
using namespace std;
template <typename X>
bool exist(vector<X> vec, X item) {
  return find(vec.begin(), vec.end(), item) != vec.end();
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long long K;
  cin >> K;
  vector<long long> ans;
  for (long long i = (long long)0; i < (long long)10; i++) {
    if (i == 0) continue;
    ans.push_back(i);
  }
  long long order = 10;
  long long nxt = order - 1;
  while (ans.size() < K) {
    for (long long i = (long long)0; i < (long long)9; i++) {
      nxt += order;
      ans.push_back(nxt);
    }
    order *= 10;
    nxt = order - 1;
  }
  for (long long i = (long long)0; i < (long long)K; i++) {
    cout << ans[i] << endl;
  }
  return 0;
}
