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>
#include <vector>

using namespace std;
typedef long long ll;

ll num_digit(ll n){
    ll nd = 0;
    for(nd = 0; n > 0; ++nd){
        n /= 10;
    }
    return nd;
}

ll sn(ll n){
    ll ret = 0;
    while(n > 0){
        ret += n % 10;
        n /= 10;
    }
    return ret;
}

ll f(ll x){
    ll nd = num_digit(x);
    ll min_n = x;
    ll min_sn = sn(x);
    ll d10 = 1;
    for(ll d = 0; d <= nd + 1; ++d, d10 *= 10){
        ll x2 = d10 * (x / d10 + 1) - 1;
        if(x2 <= x){ continue; }
        ll sx2 = sn(x2);
        if(min_n * sx2 > x2 * min_sn){
            min_n = x2;
            min_sn = sx2;
        }
    }
    return min_n;
}

int main(){
    ll k;
    cin >> k;

    ll x = 1;
    for(int i = 0; i < k; ++i, x = f(x + 1)){
        cout << x << endl;
    }
    return 0;
}
