#include <bits/stdc++.h>
using namespace std;
int mas[1000];
int res[1000];
int rCount;
struct Node {
  int val;
  Node* left;
  Node* right;
};
int N, K;
int f(Node* node, int val, int left) {
  if (node->left != 0) {
    int a = f(node->left, val, left);
    if (a == -1)
      return -1;
    else
      left = a;
  }
  if (left == 0) {
    Node* n = new Node;
    n->left = 0;
    n->right = 0;
    n->val = val;
    node->left = n;
    return -1;
  }
  if (node->val >= val + K) left--;
  if (node->right == 0) {
    if (left == 0) {
      Node* n = new Node;
      n->left = 0;
      n->right = 0;
      n->val = val;
      node->right = n;
      return -1;
    }
    return left;
  } else {
    int a = f(node->right, val, left);
    return a;
  }
}
void makeRes(Node* node) {
  if (node->left != 0) makeRes(node->left);
  res[rCount] = node->val;
  rCount++;
  if (node->right != 0) makeRes(node->right);
}
int main() {
  scanf("%d%d", &N, &K);
  for (int i = 0; i < N; i++) scanf("%d", &mas[i]);
  Node* root = new Node;
  root->val = N;
  root->left = 0;
  root->right = 0;
  Node* current = root;
  for (int i = 1; i < K; i++) {
    Node* node = new Node;
    node->left = 0;
    node->right = 0;
    node->val = N - i;
    current->left = node;
    current = node;
  }
  for (int i = N - 1 - K; i >= 0; i--) {
    f(root, i + 1, mas[i]);
  }
  rCount = 0;
  makeRes(root);
  printf("%d", res[0]);
  for (int i = 1; i < rCount; i++) printf(" %d", res[i]);
  printf("\n");
  return 0;
}
