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):
    s, a = 0, n
    while n > 0:
        s += n % 10
        n //= 10

    return a / s


def main():
    snuke = []
    base = 1

    for i in range(15):
        for j in range(1, 140):
            snuke.append(base*(j+1)-1)
        base *= 10

    snuke.sort()
    snuke.append(0)

    snuke2 = []
    for i in range(len(snuke)-1):
        if snuke[i] != snuke[i+1]:
            snuke2.append(snuke[i])

    k, idx, t = int(input()), 0, 0
    while t < k:
        for i in range(idx+1, len(snuke2)):
            if f(snuke2[idx]) > f(snuke2[i]):
                idx += 1
                break
        else:
            print(snuke2[idx])
            t += 1
            idx += 1


if __name__ == '__main__':
    main()
