#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = __int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

Integer gcd(Integer a, Integer b){ return (b==0)?a:gcd(b,a%b); }
template<class ... T> Integer gcd(Integer a, Integer b, T ... c){ return gcd(gcd(a,b), c...);}
Integer lcm(Integer a, Integer b){ if(a<b) swap(a,b); return (b==1)?a:a*(b/gcd(a,b)); }
template<class ... T> Integer lcm(Integer a, Integer b, T ... c){ return lcm(lcm(a,b), c...);}

struct hoge{
  __int128 x,y;
  void set(__int128 a, __int128 b){
    __int128 g = gcd(a,b);
    x = a/g;
    y = b/g;
  }

  bool operator<(hoge b) const {
    return x * b.y < b.x * y;
  }
};

__int128 s(__int128 x){
  __int128 res = 0;
  while(x){
    res += x%10;
    x /= 10;
  }
  return res;
}

int main(){
  long long k;
  cin >> k;

  // int len = 10000001;
  // vector< pair<hoge, int> > v(len);
  // for(int i=0; i<len; i++){
  //   v[i].first.set(i+1, s(i+1));
  //   v[i].second = i+1;
  // }
  // sort(v.begin(), v.end());
  // int mx = 0;
  // for(int i=0; i<len; i++){
  //   if( v[i].second < mx ) continue;
  //   mx = v[i].second;
  //   println( v[i].second );
  // }

  vector< pair<hoge,__int128> > v;
  for(__int128 d=0; d<=15; d++){
    __int128 nine = my_pow(10, d) - 1;
    __int128 t = my_pow(10, d);
    for(__int128 w=1; w<10000; w++){
      // if(w%10 == 9) continue;
      __int128 val = t*w + nine;
      v.push_back( { {}, val } );
      v.back().first.set(val, s(val));
    }
  }
  sort(v.begin(), v.end());
  __int128 mx = 0;

  for(__int128 i=0; i<v.size(); i++){
    if( v[i].second <= mx ) continue;
    mx = v[i].second;
    println( (long long)(v[i].second) );
    k--;
    if(k==0) break;
  }

  return 0;
}


Measured memory_bytes: 14444