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;

#define rep(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;

ll s(ll x){
    ll r = 0;
    while(x>0) { r+=x%10; x/=10; }
    return r;
}

ll f(ll x){
    // 桁数を求める
    ll n = 0;
    ll p = x;
    while(p>0) { n++; p/=10; }

    ll ans=x;
    double m = x/(double)s(x);

    ll k = 1;
    rep(i,0,n) {
        while ( (x/k)%10 < 9){
            x += k;
            if (x/(double)s(x) < m){
                ans = x;
                m = x/(double)s(x);
            }
        }
        k*=10;
    }

    return ans;
}

signed main() {
    ll K,x=1;
    cin>>K;
    while(K--){
        cout<<x<<endl;
        x = f(x+1);
    }
    return 0;
}
