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;
typedef unsigned long long ull;

ull S(ull i) {
    ull res = 0;
    while (i) {
        res += i % 10;
        i /= 10;
    }
    return res;
}

int main() {
    ull k;
    cin >> k;
    ull base = 1;
    ull begin = 1;
    for (ull i = 0; i < k; ++i) {
        cout << begin << endl;
        if (1.0 * (begin + base) / S(begin + base) > 1.0 * (begin + 2 * base) / S(begin + 2 * base)) {
            base *= 10;
        }
        begin += base;
    }
    return 0;
}

static int speedUp = []() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    return 0;
}();