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
k = int(input())

# 関数S(n)
def S(num):
  s = sum(map(int,list(str(num))))
  return num/s

#1~9と 〇9-> 〇99 -> 〇999 を出力
ten = 0
now = 1
# k回ループ
for _ in range(k) :
  print(now)
  # 桁が変わる時にten+=1する
  if S(now + 10**ten) > S(now + 10**(ten + 1)) :
    #print(now,S(now + 10**ten), S(now + 10**(ten + 1)))
    ten += 1
  now += 10**ten
    
    
  
  
  
  


