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>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<ll>;

double snk(ll n) {
	ll nn = n;
	ll s = 0;
	while (nn > 0) {
		s += nn % 10;
		nn /= 10;
	}
	return double(n) / s;
}

ll nextdig(ll n) {
	ll nn = n;
	ll s = 1;
	while (nn > 0) {
		s *= 10;
		nn /= 10;
	}
	return s;
}

bool clear(ll n, ll d) {
	ll nn = n;
	double snkn = snk(n);
	ll lim = nextdig(n);
	bool b(true);
	while (nn < lim) {
		nn += d;
		if (snk(nn) < snkn) {
			b = false;
			break;
		}
	}
	return b;
}

int main() {
	int K;
	cin >> K;
	vll v(1, 1);
	ll a = 1;
	ll d = 1;
	while (v.size() < K) {
		ll n = 1;
		while (1) {
			ll aa = a + n * d;
			if (clear(aa, d)) {
				v.emplace_back(aa);
				a = aa;
				d = n * d;
				break;
			}
			++n;
		}
	}
	for (int i(0); i < v.size(); ++i) {
		cout << v[i] << "\n";
	}
	return 0;
}