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())
num = 1
pls = 1
coun = 0

while num <= 1000000000000000 and coun < K:
    while (num/sum(list(map(int, list(str(num)))))) <= ((num+pls)/sum(list(map(int, list(str(num+pls)))))) and coun < K:
        print(num)
        coun = coun + 1
        num = num + pls
    num = num - pls
    pls = pls * 10
    num = num + pls