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 digit_sum(n):
    res = 0
    while n > 0:
        res += n % 10
        n /= 10
    return res
k = int(raw_input())
snuke_num = 1
num_of_nums = 0
increment = 1
while num_of_nums < k:
    print snuke_num
    num_of_nums += 1
    candid = snuke_num + increment
    opponent = candid + increment
    if float(candid)/digit_sum(candid) > float(opponent) / digit_sum(opponent):
        increment *= 10
    snuke_num += increment