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
import sys
def I(): return int(sys.stdin.readline().rstrip())

K = I()

A = [i for i in range(1,100)]  # Snuke数の候補

for i in range(13):
    for j in range(100,1000):
        A.append(j*10**i+10**i-1)

A.sort(reverse=True)
B = []
m = 10**18
for a in A:
    x = a/sum(int(i) for i in list(str(a)))
    if x <= m:
        B.append(a)
        m = x

B.reverse()
print(*B[:K],sep='\n')
