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
l=int(input())

def f(n):
	return n/sum(list(map(int,list(str(n)))))

a=[]
for i in range(1,16):
	if i<=3:
		for j in range(1,10):
			a.append((j+1)*(10**(i-1))-1)
	elif i<=12:
		for j in range(1,10):
			b=[j*(10**(i-1))+(k+1)*(10**(i-2))-1 for k in range(10)]
			for k in range(9)[::-1]:
				if f(b[k])>f(b[k+1]):
					b.pop(k)
			a+=b
	else:
		for j in range(1,10):
			b=[j*(10**(i-1))+(k+1)*(10**(i-3))-1 for k in range(100)]
			for k in range(99)[::-1]:
				if f(b[k])>f(b[k+1]):
					b.pop(k)
			a+=b

for i in range(l):
	print(a[i])
