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<iostream>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<(n);i++)

int digits(ll n){
  ll SUM=0;
  while(n!=0){
    SUM+=n%10;
    n=n/10;
  }
  return SUM;
}
bool compare(ll x,ll y){
  return digits(y)*x<=y*digits(x);
}

int main(){
  ll k;cin>>k;
  ll d=1,Current=0;
  rep(i,k){
    ll x=Current+d,y=Current+d*10;
    if(compare(x,y)){
      Current=x;
    }else{
      Current=y;
      d*=10;
    }
    cout<<Current<<endl;
  }
  return 0;
}