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 <cmath>
#include <algorithm>

typedef long long ll;

using namespace std;

ll S(ll n) {
    ll r = 0;
    for (ll t = n; t > 0; t /= 10) {
        r += t % 10;
    }
    return r;
}

double Snuke(ll n) {
    return 1.0 * n / S(n);
}

ll pow_int(int a, int n) {
    ll r = 1;
    for (int i = 0; i < n; ++i) {
        r *= a;
    }
    return r;
}

ll f(ll n) {
    ll x = n;
    for (int d = 0; d <= log10(n) + 1; ++d) {
        ll y = n - (n % pow_int(10, d)) + (pow_int(10, d) - 1);
        if (Snuke(x) > Snuke(y)) {
            x = y;
        }
    }
    return x;
}

int main(void) {
    int K;
    cin >> K;

    ll N = 0;
    for (int i = 0; i < K; ++i) {
        N = f(N + 1);
        cout << N << endl;
    }

    return 0;
}