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 nsn(n):
    s = 0
    nn = n
    while nn > 0:
        s += nn % 10
        nn = int(nn / 10)
    return n / s

def big(a):
    r = 1
    while a > 0:
        r *= 10
        a = int(a / 10)
    return r

def clear(a, d):
    aa = a
    asa = nsn(a)
    b = True
    ba = big(a)
    while aa < ba:
        aa += d
        if nsn(aa) < asa:
            b = False
            break
    return b

K = int(input())
T = [1]
a = 1
d = 1
while len(T) < K:
    n = 1
    while 1:
        an = a + n * d
        if clear(an, d):
            T.append(an)
            a = an
            d = n * d
            break
        n += 1
for x in T:
    print(x)