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 snuke(n):
  _n = n
  S = n % 10
  while _n:
    _n //= 10
    S += _n % 10
  return n / S
cnt = 0
k = 0
x = 1
sx = 2
while cnt < K:
  a = max(k - 1, 1)
  b = max(k, 1) * 10
  c = int('0' + ('9' * k))
  for i in range(a, b):
    y = x
    sy = sx
    x = i * 10 ** k + c
    sx = snuke(x)
    if sx >= sy:
      print(y)
      cnt += 1
      if cnt >= K:
        break
  k += 1