#include <bits/stdc++.h>
using namespace std;
int MOD = 1e9 + 7;
long long INF = 1e18;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int main() {
  long long k;
  cin >> k;
  vector<long long> ans(100010, 0);
  for (int i = 0; i < 9; i++) ans[i] = i + 1;
  int cnt = 9;
  for (int digit = 1; digit <= 2; digit++) {
    for (int i = 1; i <= 9; i++) {
      ans[cnt] = ans[cnt - 9] * 10LL + 9LL;
      cnt++;
    }
  }
  vector<long long> num = {99, 199, 299, 399, 499, 599, 699, 799, 899, 999};
  long long base = 1000;
  for (int digit = 3; digit <= 14; digit++) {
    for (long long i = 1; i <= 9; i++) {
      for (int j = 0; j < 10; j++) {
        ans[cnt] = i * base + num[j];
        cnt++;
      }
    }
    base *= 10LL;
    for (int i = 0; i < 10; i++) {
      num[i] = num[i] * 10LL + 9LL;
    }
  }
  for (int i = 0; i < k && ans[i] != 0; i++) cout << ans[i] << endl;
}
