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;

long f(long x){
  string s = std::to_string(x);
  int n = s.size();
  long y = 0;
  for(int i = 0;i < s.size();i++){
    y += (s.at(i) - '0');
  }
  long ans = x;
  for(int i = n-2;i >= 0;i--){
    for(int j = n-1;j >= i+1;j--){
      s.at(j) = '9';
    }
    for(char j = s.at(i);j <= '9';j++){
      s.at(i) = j;
      //cout << s << endl;
      double x2 = std::stod(s);
      double y2 = 0;
      for(int k = 0;k < s.size();k++){
        y2 += (s.at(k) - '0');
      }
      double x3 = x;double y3 = y;
      //cout << x2 << ' ' << y2 << ' ' << x3 << ' ' << y3 << endl; 
      if(x3/y3 > x2/y2){
        ans = x2;
        x = x2;
        y = y2;
        //cout << ans << endl;
      }
    }
  }
  return ans;
}
int main(){
  long k;
  cin >> k;
  long x = 2;
  cout << 1 << endl;
  for(int i = 0;i < k-1;i++){
    long y = f(x);
    cout << y << endl;
    x = y+1;
  }
}