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
def sk(k):
  tk = k
  ret = 0
  while tk!=0:
    ret+=tk%10
    tk//=10
  return ret

ans = []
for i in range(1,100):
  tmp = i/sk(i)
  if len(ans)==0:
    ans.append((i,tmp))
  else:
    l=ans[-1]
    if l[1]>tmp:
      ans[-1]=(i,tmp)
    else:
      ans.append((i,tmp))

for j in range(15):
  for i in range(100,1000):
    n=int(str(i)+''.join(['9']*j))
    tmp=n/sk(n)
    if ans[-1][1] > tmp:
      while ans[-1][1]>tmp:
        ans.pop()
    ans.append((n,tmp))

for i in range(int(input())):
  print(ans[i][0])