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 main():
    def f(N):
        S = 0
        tmp = N
        while tmp > 0:
            S += tmp%10
            tmp //= 10
        return N/S
    
    import sys
    input = sys.stdin.readline
    K = int(input())
    Ans = []
    for i in range(1,10):
        Ans.append(i)
    
    tmp = 0
    T = 1
    nine = 1
    while tmp < 10**15:
        N = T*10**nine + 10**nine - 1
        if f(N) <= f(N+10**nine):
            Ans.append(N)
            T += 1
        else:
            nine += 1
            T //= 10
        tmp = T*10**nine + 10**nine - 1
    print(*Ans[:K],sep = "\n")
    
    
main()