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 snu(n):
    s=str(n)
    kei=sum(int(x) for x in s)
    return n/kei

def nn(n):
    s=str(n)
    kt=len(str(int(snu(n))))
    if s[-kt:].count("9")==kt:
        if s[-kt-1]=="9":
            n+=10**kt
            s=str(n)
            kt = len(str(int(snu(n))))
            if s[-kt:].count("9") == kt:
                return n
            else:
                s = s[:-kt] + "9" * kt
                return int(s)
        else:
            return n+10**kt
    else:
        s=s[:-kt]+"9"*kt
        return int(s)

k=int(input())
t=9 if k>9 else k
for i in range(1,t+1):
    print(i)
if k<=9:exit()
n=19
for _ in range(k-9):
    print(n)
    n=nn(n)