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>
using namespace std;
typedef long long ll;

ll k;

double s(ll num) {
	string s = to_string(num);
	double res = 0;
	for (int i = 0; i < s.length(); i++) {
		res += s[i] - '0';
	}

	return res;
}

ll dm(ll num, ll d) {
	string a = to_string(d);
	string b = to_string(num);
	b[b.length() - a.length()] = '9';

	return stoll(b);
}

int main() {
	cin >> k;


	ll ans = 1;
	ll d = 1;
	for (int i = 0; i < k; i++) {
		if (ans/s(ans) > (ans+d)/s(ans+d)) {
			ans = dm(ans, d);
			d *= 10;
		}

		cout << ans << endl;
		ans += d;
	}
}