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
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

K = int(read())

cand = set()
for d in range(15):
    for x in range(1,1000):
        y = x*(10**d)-1
        cand.add(y)
cand.remove(0)

cand = sorted(cand,reverse=True)

def S(n):
    x = 0
    while n:
        q,r = divmod(n,10)
        x += r
        n = q
    return x

answer = []
opt_S = 1
opt_N = cand[0]+1
for x in cand:
    s = S(x)
    if x*opt_S <= s * opt_N:
        answer.append(x)
        opt_S = s; opt_N = x

print('\n'.join(map(str,answer[::-1][:K])))