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;
double compute(long long a)
{
	long long temp = a, sum = 0;
	while(temp)
	{
		sum += temp % 10;
		temp /= 10;
	}
	double ans = (double) a / sum;
	return ans;
}
int main()
{
	int a;
	cin >> a;
	long long now = 1, toplus = 1;
	for(int i=1; i<=a; i++)
	{
		printf("%lld\n",now);
		double one = compute(now + toplus), two = compute(now + (toplus * 10));
		if(one > two) toplus *= 10;
		now += toplus;
	}
	return 0;
}