Let S(n) denote the sum of the digits in the decimal notation of n. For example, S(123) = 1 + 2 + 3 = 6.

We will call an integer n a Snuke number when, for all positive integers m such that m > n, \frac{n}{S(n)} \leq \frac{m}{S(m)} holds.

Given an integer K, list the K smallest Snuke numbers.

Constraints

* 1 \leq K
* The K-th smallest Snuke number is not greater than 10^{15}.

Input

Input is given from Standard Input in the following format:


K


Output

Print K lines. The i-th line should contain the i-th smallest Snuke number.

Example

Input

10


Output

1
2
3
4
5
6
7
8
9
19
#include <bits/stdc++.h>
using namespace std;

double S(long long N){
  double ans=0;
  while(N>0){
    ans += N%10;
    N /= 10;
  }
  return (double)ans;
}


void test(){
  vector<double> V(50000);
  for(int i=0; i<50000; i++){
    V[i] = (i+1)/(double)S(i+1);
  }
  vector<bool> check(50000,false);
  double minv = 50000.0;
  for (int i=49999; i>=0; i--){
    if (minv >= V[i]){
      check[i] = true;
      minv = V[i];
    }
  }
  for(int i=0; i<50000; i++){
    //cout << V[i] << endl;
    if (check[i]) cout << i+1 << endl;
  }
}


int main(){
  //test();
  int K;
  cin >> K;
  int count = 0;
  long long dif = 1;
  long long ans = 0;
  while(count<K){
    if ((ans+dif)/(double)S(ans+dif) <= (ans+dif*10)/(double)S(ans+dif*10)){
      ans += dif;
      cout << ans << endl;
      count++;
    } else{
      dif *= 10;
      ans += dif;
      cout << ans << endl;
      count++;
    }
  }
}
