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>

using namespace std;

#define ull unsigned long long 

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

int main() {
	ull K;
	cin >> K;
	
	ull cnt = 1;
	ull base = 1;
	ull diff = 1;
	while (cnt <= K && cnt < 10) {
		cout << cnt << endl;
		++cnt;
	}

	ull val = 9;
	ull x = 10;
	ull buf, s1, s2;
	while (cnt <= K) {
		val += x;
		cout << val << endl;

		s1 = S(val + x);
		s2 = S(val + 10 * x);

		if ((val + x * 10) * s1 <= (val + x) * s2) {
			x *= 10;
		}
		++cnt;
	}

	//system("pause");
	return 0;
}
