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 <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <complex>
typedef long long int LL;
using namespace std;

// 插入此處

double s(LL n) {
    LL c = n;
    LL d = 0;
    while (c > 0) {
        d += (c % 10);
        c /= 10;
    }
    return d;
}

double snuke(LL n) {
    return double(n) / s(n);
}

int main() {
    // printf("%lf\n", pow(10LL, 15LL));
    int k;
    scanf("%d", &k);
    int count = 0;

    LL interval = 1;
    LL x = 1;
    while (count < k) {
        if (snuke(x) <= (double)interval) {
        // if (snuke(x) <= snuke(x + interval)) {
            printf("%lld\n", x);
            x += interval;
            count++;
        } else {
            x -= interval;
            interval *= 10;
            x += interval;
        }
    }
}
