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>
#define mod 1000000007
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define nyan "(=^･ω･^=)"
#define mkp make_pair
#define lP pair<ll, ll>
#define iP pair<int,int>
typedef long long ll;
using namespace std;

int K;
ll t, a[16];

double snuke(ll x) {
	double d = 0;
	for (int i = 0; i != 15; ++i) {
		d += (x%a[i + 1]) / a[i];
	}
	return x / d;
}

int main() {
	a[0] = 1;
	for (int i = 1; i != 16; ++i)
		a[i] = a[i - 1] * 10;
	cin >> K;
	t = 1;
	cout << 1 << endl;
	for (int i = 0; i != K - 1; ++i) {
		ll nextt;
		double d = llmax;
		for (int j = 0; j != 15; ++j) {
			ll k = t - t%a[j] + a[j] * 2 - 1;
			if (d > snuke(k)) {
				d = snuke(k);
				nextt = k;
			}
		}
		t = nextt;
		cout << t << endl;
	}
	return 0;
}
