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;
double ans(long long x) {
	long long sum = 0;
	long long ans = x;
	while (x) {
		sum += x % 10;
		x /= 10;
	}
	return ans * 1.0 / (sum*1.0);
}

int main()
{
	long long k;
	cin >> k;
	long long x = 1, z = 0;
	while (k > 0) {
		if ((z/x)%10!=9) {
			z += x;
			cout << z << endl;
		}
		else {
			if (ans(z + x) > ans(z + 10 * x)) {
				x = 10 * x;
			}
			z += x;
			cout << z << endl;
		}
		k--;
	}
	return 0;
}