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;

long long pw[20];

int main() {
	
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	
	pw[0] = 1;
	for (int i = 1; i < 20; i++) pw[i] = pw[i - 1] * 10;
	
	int K; cin >> K;
	long long now = 0;
	while (K--) {
		now++;
		auto nxt = now, nxt_sum = 0LL;
		{
			auto buf = now;
			while (buf) nxt_sum += buf % 10, buf /= 10;
		}
		for (int i = 1; i < 18; i++) if (now >= pw[i]) {
			auto cur = now / pw[i] * pw[i] + pw[i] - 1;
			auto sum = 0LL, buf = cur;
			while (buf) sum += buf % 10, buf /= 10;
			if ((long long)cur * nxt_sum < (long long)nxt * sum) {
				nxt = cur, nxt_sum = sum;
			}
		}
		now = nxt;
		cout << now << "\n";
	}
	
	return 0;
}
