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 
import java.io.*;
import java.util.*;

public class B67 {

	public static void main(String args[]) throws IOException {
		boolean online = System.getProperty("ONLINE_JUDGE") != null;
		Scanner in = online ? new Scanner(System.in) : new Scanner(new FileReader("input.txt"));
		PrintWriter out = online ? new PrintWriter(System.out) : new PrintWriter(new FileWriter("output.txt"));

	int n,k,p,count,it;
	n = in.nextInt();
	k = in.nextInt();
	int[] b = new int[n];
	LinkedList a = new LinkedList();
	
	for(int i=0;i<n;i++)
		b[i] = in.nextInt();	
	
	a.add(n);
	//ListIterator it; //= a.listIterator();
	p = -1;
	for(int i=n-1; i>=0; i--) {
		if (b[i] == 0)
			a.addFirst(i+1);
		else {
			it = 0;//it = a.listIterator();
			count = 0;
			while ( (count<b[i]) &&  (it<a.size())) {
				p = (Integer) a.get(it);
				//out.print("p = " + p);
				if (p > k+i)
					count++;
				it++;
			}
			a.add(it,i+1);
		}
	
	}
	
	ListIterator iter = a.listIterator();
	for(int i=0;i<n;i++)
		out.print(iter.next() + " ");

	out.flush();
	return;
	}
}	
