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
# 下d+1桁目が初めて9でないとする
# [__X__]99999
# [_X++_]99999に勝つ必要がある
# 10^d(X+1)-1 / (S(X) + 9d) <= (10^d(X+2)-1) / (S(X)+9d+1)
# (S(X)+9d+1)/(S(X)+9d) <= (10^d(X+2)-1)/(10^d(X+1)-1)
# 1/(S(X)+9d) <= 10^d / (10^d(X+1)-1) <= 1/X
# X <= S(X)+9d <= 135

def S(n):
  if n < 10:
    return n
  return S(n//10) + n%10
  
li = [] # 候補、とりあえず十分量作る

for d in range(20):
  a = 10**d
  for x in range(200):
    y = (x+1)*a-1
    if y > 0:
      z = S(y)
      li.append((y,z))
    
li = sorted(list(set(li)),reverse=True)

# 右から見ていって、その時点での最小値タイ以下なら採用
answer = []
min_N,min_S = li[0]
for n,s in li[1:]:
  # n/s < min_N/min_S
  if n*min_S <= s*min_N:
    min_N = n
    min_S = s
    answer.append(n)


K = int(input())
answer.sort()
answer = answer[:K]
print('\n'.join(map(str,answer)))

