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;

typedef long long ll;

double Snuke(ll x) {
	ll tmp = 0, c = x;
	while(c) {
		tmp += c % 10;
		c /= 10;
	}
	return 1.0 * x / tmp;
}

int main() {
	int K;
	cin >> K;
	ll res = 0, x = 1;
	while(K--) {
		double t1, t2;
		while(true) {
			t1 = Snuke(res + x), t2 = Snuke(res + x * 10);
			if(t1 <= t2) break;
			x *= 10;
	//		cout<<t1<<" "<<t2<<endl;
		}
		res += x;
		printf("%lld\n", res);
	}
	return 0;
}