#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int, int>, int>;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}
long long gcd(long long a, long long b) {
  if (a % b == 0)
    return (b);
  else
    return (gcd(b, a % b));
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long double Sdigit(long long a) {
  string s = to_string(a);
  long long sum = 0;
  for (long long i = 0; i < (long long)(s.length()); ++i) {
    sum += s[i] - '0';
  }
  long double a2 = a;
  long double sum2 = sum;
  return a2 / sum2;
}
int main() {
  cout << fixed << setprecision(15);
  long long K;
  cin >> K;
  vector<pair<long double, long long>> ans;
  for (long long i = 0; i <= 14; i++) {
    for (long long j = 2; j <= 10; j++) {
      pair<long double, long long> p;
      p.first = Sdigit(long long(pow(10, i) * j - 1));
      p.second = long long(pow(10, i) * j - 1);
      ans.push_back(p);
    }
  }
  sort(ans.begin(), ans.end());
  long long count = 0;
  for (auto p : ans) {
    if (count == K) break;
    cout << p.second << endl;
    count++;
  }
  return 0;
}
