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 fun(ll i) {
	ll ii = i;
	ll ans = 0;
	while(i) {
		ans += i % 10;
		i /= 10;
	}
	return double(ii) / ans;
}

int main() 
{
	int n;
	cin >> n;
	ll k = 0, kk = 1;
	for(int i = 0; i < n; i++) {
		if( (k / kk) % 10 == 9 && fun(k + kk) > fun(k + 10*kk) ) kk *= 10;
		k += kk;
		cout << k << endl;
	}
}