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())

def nd(n):
    ans = 0
    nn = n
    while(nn > 0):
        ans += nn%10
        nn //= 10
    return ans/n

def k_next(k):
  d = 1
  c_max = 0
  ans = k
  while(d < k*10):
    cand = (k//d+1)*d+(k%d)
    if nd(cand) >= c_max:
      c_max = nd(cand)
      ans = cand
    d *= 10
  return ans

k = 1
for i in range(K):
  print(k)
  k = k_next(k)


