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;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define Would
#define you
#define please

double snukecalc(long long number) {
	long long karinum = number;
	long long S = 0;
	while (karinum) {
		S += karinum % 10;
		karinum /= 10;
	}
	return 1.0 * number / S;
}





int main() {
	
	int K;
	cin >> K;

	int kazu = 0;
	int sita9 = 0;
	long long uesuuji = 0;

	while(kazu < K) {
		uesuuji++;
		long long hontou = uesuuji * pow(10, sita9);
		rep(i, sita9) hontou += 9 * pow(10, i);

		long long tugi = hontou + pow(10, sita9);
		if (snukecalc(hontou) > snukecalc(tugi)) {
			sita9++;

			rep(i, sita9) hontou -= 9 * pow(10, i);
			if (hontou <= 0) uesuuji = 0;
			else uesuuji = hontou / pow(10, sita9);

			continue;
		}
		else {
			cout << hontou << endl;
			kazu++;
		}
	}
	Would you please return 0;

}