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;
typedef long long ll;
ll a[100005];
ll Pow(ll a, int b){
    ll ans = 1;
    while(b){
        if(b&1) ans = ans*a;
        a = a * a;
        b >>= 1;
    }
    return ans;
}
ll cal(ll x){
    ll ans = 0;
    while(x){
        ans += (x % 10); x /= 10;
    }
    return ans;
}
int main(){
    /*
    a[1] = 1;
    for(int i = 2; i <= 100000; ++i){
        a[i] = a[i-1] + Pow(10, floor(i-1)/9);
    }
    */
    int k;
    scanf("%d", &k);
    /*
    a[0] = 0;
    a[1] = 1;
    for(int i = 2; i <= k; ++i){
        a[i] = 1ll * (i % 9 + 1) * Pow(10, (int)floor(1.0*i/9)) - 1;
    }
    for(int i = 1; i <= k; ++i){
        printf("%lld\n", a[i]);
    }
    */
    ll x = 0, x1, x2, m = 1;
    for(int i = 1; i <= k; ++i){
        x1 = x + m, x2 = x + m * 10;
        if(x1*cal(x2) <= x2*cal(x1)) x = x1;
        else{
            x = x2;
            m *= 10;
        }
        printf("%lld\n", x);
    }
    return 0;
}
