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
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(input())

def rl():
    return list(input().split())

def rli():
    return list(map(int, input().split()))

def calc(n):
    s = sum(map(int, str(n)))
    return n / s

def f(n):
    ld = list(map(int, str(n)))
    cand = []
    for i in range(len(ld)-1):
        d = len(ld)-1-i
        ld[d] = 9
        for i in range(1, 10):
            if i < ld[d-1]:
                continue
            ld[d-1] = i
            p = int("".join(map(str, ld)))
            cand.append((calc(p), p))
    cand.sort()
    return cand[0][1]

MAX = 10**15
def main():
    k = ri()
    cand = list(range(1, 10))
    n = 10
    while True:
        if n > MAX:
            break
        p = f(n)
        cand.append(p)
        n = p+1
    print("\n".join(map(str, cand[:k])))


if __name__ == '__main__':
    main()
