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>

#define ll long long
#define fornum(A,B,C) for(A=B;A<C;++A)
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

/////////////////////////////////////////////////////

ll K;
ll i, j, k;
ll ansCnt;
ll S(ll a){
    ll ret = 0;
    while(a>0){
        ret += a % 10;
        a /= 10;
    }
    return ret;
}
void dfs(ll a,ll ii){
    if(ii==0){
        if(a>0){
            printf("%lld\n", a);
            ++ansCnt;
            if(K==ansCnt){
                exit(0);
            }
        }
        return;
    }
    ll i;
    ll aa = a + ii - 1;
    ll bb = a + ii * 9 + ii - 1;
    if(aa*S(bb)>bb*S(aa)){
        
        printf("%lld\n", bb);
        ++ansCnt;
        if(K==ansCnt){
            exit(0);
        }
        return;
    }

    fornum(i,0,10){
        dfs(a + ii * i, ii / 10);
    }
}

int main(){
    scanf("%lld", &K);
    dfs(0, 1e15);

    


    return 0;
}