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
from math import log10


def S(x):
    a = [int(i) for i in str(x)]
    return sum(a)

def f(N):
    tmp = (N, N / S(N))
    for d in range(int(log10(N) - 1) + 1):
        x = pow(10, d + 1) * int(N / pow(10, d + 1) + 1) - 1
        sunuke = x / S(x)
        if tmp[1] > sunuke:
            tmp = (x, sunuke)
    return tmp[0]


K = int(input())
ans = [1]
N = 1
K -= 1
while K > 0:
    N = f(N + 1)
    ans.append(N)
    K -= 1

print(*ans, sep='\n')
