#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
int a, b, c, d, i, j, n, m, k;
int mas[1002], ans[1002];
bool used[1002];
int fen[1002];
inline void add(int first, int a) {
  for (int i = first; i <= n; i |= i + 1) fen[i] += a;
}
inline int sum(int first) {
  int ans = 0;
  for (; first >= 0; first = (first & (first + 1)) - 1) ans += fen[first];
  return ans;
}
inline int sum(int l, int r) {
  if (l > r) return 0;
  if (!l)
    return sum(r);
  else
    return sum(r) - sum(l - 1);
}
int main() {
  scanf("%d%d", &n, &k);
  for (int _n((n)-1), i(0); i <= _n; i++) scanf("%d", &mas[i]);
  for (int _n((n)-1), i(0); i <= _n; i++) {
    for (int _n((n)-1), j(0); j <= _n; j++) {
      if (used[j] || sum(j + k, n - 1) != mas[j]) continue;
      used[j] = 1;
      ans[i] = j;
      add(j, 1);
      break;
    }
    if (i) printf(" ");
    printf("%d", ans[i] + 1);
  }
  printf("\n");
}
