Let A = {a1, a2, ..., an} be any permutation of the first n natural numbers {1, 2, ..., n}. You are given a positive integer k and another sequence B = {b1, b2, ..., bn}, where bi is the number of elements aj in A to the left of the element at = i such that aj ≥ (i + k).

For example, if n = 5, a possible A is {5, 1, 4, 2, 3}. For k = 2, B is given by {1, 2, 1, 0, 0}. But if k = 3, then B = {1, 1, 0, 0, 0}.

For two sequences X = {x1, x2, ..., xn} and Y = {y1, y2, ..., yn}, let i-th elements be the first elements such that xi ≠ yi. If xi < yi, then X is lexicographically smaller than Y, while if xi > yi, then X is lexicographically greater than Y.

Given n, k and B, you need to determine the lexicographically smallest A.

Input

The first line contains two space separated integers n and k (1 ≤ n ≤ 1000, 1 ≤ k ≤ n). On the second line are n integers specifying the values of B = {b1, b2, ..., bn}.

Output

Print on a single line n integers of A = {a1, a2, ..., an} such that A is lexicographically minimal. It is guaranteed that the solution exists.

Examples

Input

5 2
1 2 1 0 0


Output

4 1 5 2 3 

Input

4 2
1 0 0 0


Output

2 3 1 4 
# /*******************************************************************************
# * Author       : Quantum Of Excellence
# * email        : quantumofexcellence (at) gmail (dot) com
# * copyright    : 2014 - 2015
# * date         : 6 - 11 - 2015
# * Judge Status : 
# * file name    : 67B.py
# * version      : 1.0
# *
# * TERMS OF USE - Write a mail to the author before copying or reusing the content of this file 
# * seeking our permission for the same.
# * Copying/reuse of the below code without the permission of the author is prohibited and illegal.
# *
# * All rights reserved by Quantum Of Excellence.
# ******************************************************************************/

# /*******************************************************************************
# * some pointers on the logic/idea - 
# *
# * 
# *******************************************************************************/


# test cases-


#import sys
#fi = open("G:\DUMP\input.in","r")
#sys.stdin = fi
u=input
n,k=map(int,u().split())
M=[int(i) for i in u().split()]
m=0
for j in range(n):
 # find unvisited zeros
 for p in range(n):
  if(0==M[p]):
   print(p+1,end=' ')
   break
 for l in range(p+1-k):M[l]-=1
  # make the visited zero negative
 M[p]-=1
