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
def f(N):
    l = 0
    NN = N
    while True:
        l += 1
        NN //= 10
        if NN < 10:
            break
    m = N / sum(map(int,list(str(N))))
    num = -1
    for d in range(0,l+2):
        x = (10 ** (d+1)) * int(N/(10**(d+1))+1) - 1
        sx = sum(map(int,list(str(x))))
        value = x/sx
        if value < m:
            m = value
            num = d
    if num == -1:
        return N
    else:
        return (10 ** (num+1)) * int(N/(10**(num+1))+1) - 1

K = int(input())

N = 1
ans = [1]

while len(ans) < K:
    N = f(N+1)
    ans.append(N)

for i in ans:
    print(i)
