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 <string>
#include <vector>
#include <stdlib.h>
#include <cstdint>
using namespace std;

long long s(long long x)
{
    long long ret = 0;
    while (x > 0) {
        ret += x % 10;
        x /= 10;
    }
    return ret;
}

bool compare( long long x, long long y )
{
	return (double)x / s(x) < (double)y / s(y);
}

int main()
{
	long long k;

	cin >> k;

	long long d = 1, cur = 0;
	for( int i = 0; i < k; i++ ) {
		long long x = cur + d;
		long long y = cur + d * 10;
		if (compare(x, y)) {
            cur = x;
        }
		else {
            cur = y;
            d *= 10;
        }
        cout << cur << endl;
    }

	return 0;
}
