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
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()

from math import log10

def f(x):
    s=sum(int(c) for c in str(x))
    return x/s

def next(x):
    d=int(log10(x))
    A=list(str(x))
    res=-1
    score=INF
    for i in range(d,-1,-1):
        A[i]='9'
        tmp=int(''.join(A))
        if(score>f(tmp)):
            score=f(tmp)
            res=tmp
    return res

def resolve():
    k=int(input())
    if(k<10):
        for i in range(1,k+1):
            print(i)
        return
    for i in range(1,10):
        print(i)
    k-=9
    now=9
    for _ in range(k):
        now=next(now+1)
        print(now)
resolve()