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;

vector<long long> ans;
vector<long double> snk;
long long now=1,k,countn=0;

int main(){
  long long i,j;
  cin >> k;
  for(i=0;i<=15;i++){
    for(j=0;j<=150;j++){
      ans.push_back((j+1)*now-1);
    }
    now*=10;
  }
  sort(ans.begin(),ans.end());
  for(i=0;i<ans.size();i++){
    long long nk=ans[i],nks=0;
    while(nk>0){
      nks+=nk%10;
      nk/=10;
    }
    snk.push_back((long double)ans[i]/nks);
  }
  /*for(i=1;i<1000;i++){
    if(ans[i]<100)cout << ans[i] <<"\t"<< snk[i] << endl;
    }*/
  for(i=1;i<ans.size();i++){
    if(ans[i]==ans[i-1])continue;
    for(j=i+1;j<ans.size();j++){
      if(snk[i]>snk[j])break;
      if(j==ans.size()-1){
	cout << ans[i] << endl;
	countn++;
	if(k==countn)break;
      }
    }
    if(k==countn)break;
  }
  return 0;
}
