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;

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	vector<long long> ans;
	long long x = 0;
	do {
		++ x;
		int a[15], c = 0;
		long long t = x, f = 0;
		while(t) {
			a[c ++] = t % 10;
			f += t % 10;
			t /= 10;
		}
		for(int i = 0; i <= c; ++ i) {
			long long v = 0, sv = 0;
			for(int j = c - 1; j >= 0; -- j) {
				if(j < i) v = v * 10 + 9, sv += 9;
				else v = v * 10 + a[j], sv += a[j];
			}
			if(x * sv > f * v) {
				x = v; f = sv;
			}
		}
		ans.push_back(x);
	} while(x < (long long)1e15 - 1);
	int k; cin >> k;
	for(int i = 0; i < k; ++ i) cout << ans[i] << "\n";
	return 0;
}
