#include <iostream>
#include <deque>
#include <algorithm>
using namespace std;

long long hoge(long long n) {
 int m = 0;
while(n >0){
m += n %10;
n /= 10;
}
return m;
}
int main() {
duque<long long> n;
long long max = 1000000000000000ll;
for(long long i = 1000000000000000ll;i > 0; i-=1) {
  long long m = hoge(i);
if(i / m < max) {
 n.push_front(i);
max = i / m;
}
}

long long k;
cin >> k;
for ( long long i = 0;i < k;i++) {
cout << n[i] << endl;
}
}