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

def calc(n):
    return sum(int(c) for c in str(n))

def check(n):
    for i in range(1, len(str(n))):
        p = 10**i
        m = (n // p + 1) * p - 1
        if n / calc(n) > m / calc(m):
            return False
    return True

def getlist():
    n, prev_n, d = 1, 0, 1
    while 1:
        if check(n):
            yield n
            d = n - prev_n
            prev_n = n
        n += d

from itertools import islice

for n in islice(getlist(), K):
    print(n)
