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<sstream>
#include<vector>
#include<iterator>
#include<algorithm>
using namespace std;

long long calc(long long n)
{
	if(n < 10)
		return n;

	return n%10 + calc(n/10);
}

long long f(long long n)
{
	string str = to_string(n);
	vector<long long> v;
	v.push_back(n);

	for(auto it=str.rbegin(); it!=str.rend(); it++){
		*it = '9';
		v.push_back(stoll(str));
	}

	vector<double> vv(v.size());
	for(int i=0; i<vv.size(); i++)
		vv[i] = 1.0 * v[i] / calc(v[i]);
	
	int index = min_element(vv.begin(), vv.end()) - vv.begin();

	return v[index];
}

int main(void)
{
	int K;
	cin >> K;

	long long n = 1;
	for(int i=0; i<K; i++){
		cout << n << endl;

		n = f(n+1);
	}

	return 0;
}
