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;
ll f(ll n) {
	string str = to_string(n);
	ll sum = 0;
	for (int i = 0; i < str.size(); i++) sum += str[i] - '0';
	for (int i = str.size() - 1; i >= 0; i--) {
		for (int j = str[i] - '0'; j <= 9; j++) {
			string t = str.substr(0, i + 1);
			t[i] = '0' + j;
			t += string(str.size() - i - 1, '9');
			ll m = 0;
			ll s = 0;
			for (int k = 0; k < t.size(); k++) {
				m *= 10;
				m += t[k] - '0';
				s += t[k] - '0';
			}
			if (m*sum < n*s) {
				n = m;
				sum = s;
			}
		}
	}
	return n;
}
 int main() {
	 int K;
	 cin >> K;
	 ll n = 1;
	 for (int i = 0; i < K; i++) {
		 cout << n << endl;
		 n = f(n + 1);
	 }
}