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 math

def next_sunuke(N):
    D = math.ceil(math.log(N,10) + 1)
    z = str(N)
    zx = [int(z[:1]) for z in z]
    Z = N / sum(zx)
    ret_val = N
#    print(Z)
    ret_vals = [ret_val]
    for d in range(0, D):
        x = ( (10 ** (d + 1)) * math.floor((N / (10 ** (d+1))) + 1 ) ) - 1
#        print(x)
        w = str(x)
        sx = [int(w[:1]) for w in w]
        y = x / sum(sx)
#        print(x,w,sx,sum(sx),y)
        if y == Z:
            Z = y
            ret_vals.append(x)
        elif y < Z:
            Z = y
            ret_vals = []
            ret_vals.append(x)
        #print(min(ret_vals))

#    print(ret_vals)
    return min(ret_vals)

K = int(input())
n = 1
for i in range(1,K+1):
    print(next_sunuke(n))
    n = next_sunuke(n) + 1
