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>
/*
S(100000000)=1,
100000000/s(100000000)=100000000
そんなにないってことでは？
*/
using namespace std;
#define ll long long

ll least(ll a){
    if (a<10000){
        return 1;
    }else{
        ll n=1;
        while(a/10000>n)n*=10;
        return n;
    }
}

int main(){
    int k;
    cin >> k;
    double tmp=9999999990000000.0;
    int cnt=0;
    ll anslist[800];
    for(ll i=999999999999999;i>0;i-=least(i)){
        ll n=i;
        ll a=n,b=0;
        ll ans=0;
        while(n>0){
            b+=n%10;
            n/=10;
        }
        if(tmp>=double(a)/double(b)){
//            cout << double(a)/double(b) <<" "<< a<< endl,cnt++;
            anslist[cnt]=a;
            cnt++;
        }
        tmp=min(tmp,double(a)/double(b));
    }
    for(int i=cnt-1;i>cnt-1-k;i--){
        cout <<anslist[i]<<endl;
    }
    return 0;
}