#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
long long int A[MAXN + 1];
bool cmp(long long int x, long long int y) {
  long long int c = x, d = y;
  long long int sum1 = 0, sum2 = 0;
  while (c) {
    sum1 += c % 10;
    c /= 10;
  }
  while (d) {
    sum2 += d % 10;
    d /= 10;
  }
  return c * x <= d * y;
}
int main() {
  int k;
  scanf("%d", &k);
  for (int i = 0; i < 9; i++) A[i] = i + 1;
  int cnt = 9;
  long long int pi = 1;
  long long int pii = 0;
  while (cnt < k) {
    pii *= 10;
    pii += 9;
    pi *= 10;
    int mx = 0;
    for (int i = 9; i >= 1; i--) {
      long long int s = pi * i + pii;
      if (cmp(s, mx)) {
        A[cnt++] = s;
        mx = s;
      }
    }
  }
  sort(A, A + cnt);
  for (int i = 0; i < k; i++) printf("%lld\n", A[i]);
  return 0;
}
