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())
tmp=0
i=0
k=0
res=1
def S(a):
  res=0
  while(a!=0):
    res+=a%10
    a//=10
  return res
def check(i,a):
  if (10**i)*S(a)<a:
    return True
  return False
while(True):
  if k==K:
    break
  print(res)
  k+=1
  res+=10**i
  if check(i,res):
    res-=10**i
    i+=1
    res+=10**i
