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

using namespace std;

long long s(long long n) {
    long long ans = 0;

    while (n) {
        ans += n % 10;
        n /= 10;
    }

    return ans;
}

long long f(long long n) {
    long long d = 0, tmp = n;
    while (tmp) {
        tmp /= 10;
        d++;
    }

    long long x, ans = n;
    // cout << ans << endl;
    for (int i = 0; i < d; i++) {
        x = (long long)(pow(10, i+1)) * (n / (long long)(pow(10, i+1)) + 1) - 1;
        // cout << x << endl;
        if (x * s(ans) < ans * s(x)) {
            ans = x;
        }
    }

    return ans;
}

int main() {
    int k;
    cin >> k;
    long long n = 1;
    cout << n << endl;
    for (int i = 1; i < k; i++) {
        cout << f(n+1) << endl;
        n = f(n+1);
    }
    // cout << f(12345) << endl;
}
