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
k = int(input())
def f(n):
	num,ans = n/sum([int(i) for i in str(n)]),n
	for i in range(len(str(n))+1):
		x = (10**(i+1))*(n//(10**(i+1))+1)-1
		y = x/sum([int(j) for j in str(x)])
		if num>y: ans,num = x,y
	return ans
n = 0
for _ in range(k):
	n = f(n+1)
	print(n)