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 digit_sum(s):
    return sum(map(int, list(s)))

def func1(s):
    return int(s)/digit_sum(s)

def func2(n):
    n = str(n)
    fm, fa = float("inf"), -1
    for i in range(len(n)):
        s = n[:i+1] + "9"*(len(n)-i-1)
        if fm > func1(s):
            fm = func1(s)
            fa = int(s)
    return fa

n = 1
for _ in range(k):
    print(n)
    n = func2(n+1)


