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;
#define int long long

int s(int n){
  int res=0;
  while(n>0){
    res+=n%10;
    n/=10;
  }
  return res;
}

double f(int n){
  return (double)n/s(n);
}

signed main(){
  vector<int> v;
  int b=1;
  for(int i=0;i<15;i++){
    for(int j=1;j<150;j++){
      v.push_back(b*(j+1)-1);
    }
    b*=10;
  }
  sort(v.begin(),v.end());
  v.erase(unique(v.begin(),v.end()),v.end());
  for(int i=0;i<v.size();i++){
    for(int j=i+1;j<v.size();j++){
      if(f(v[i])>f(v[j])){
	v.erase(v.begin()+i--);
	break;
      }
    }
  }
  int k;
  cin>>k;
  for(int i=0;i<k;i++)cout<<v[i]<<endl;
  return 0;
}
