You are given a permutation P_1 ... P_N of the set {1, 2, ..., N}.

You can apply the following operation to this permutation, any number of times (possibly zero):

* Choose two indices i,j (1 ≦ i < j ≦ N), such that j - i ≧ K and |P_i - P_j| = 1. Then, swap the values of P_i and P_j.



Among all permutations that can be obtained by applying this operation to the given permutation, find the lexicographically smallest one.

Constraints

* 2≦N≦500,000
* 1≦K≦N-1
* P is a permutation of the set {1, 2, ..., N}.

Input

The input is given from Standard Input in the following format:


N K
P_1 P_2 ... P_N


Output

Print the lexicographically smallest permutation that can be obtained.

Examples

Input

4 2
4 2 3 1


Output

2
1
4
3


Input

5 1
5 4 3 2 1


Output

1
2
3
4
5


Input

8 3
4 5 7 8 3 1 2 6


Output

1
2
6
7
5
3
4
8
#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0;
  bool t = false;
  char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') t = true, ch = getchar();
  while (ch <= '9' && ch >= '0') x = x * 10 + ch - 48, ch = getchar();
  return t ? -x : x;
}
int n, K;
struct Line {
  int v, next;
} e[500500 << 1];
int h[500500], cnt = 1, dg[500500];
inline void Add(int u, int v) {
  e[cnt] = (Line){v, h[u]};
  h[u] = cnt++;
  dg[v]++;
}
int a[500500], P[500500], ans[500500], tot;
priority_queue<int, vector<int>, greater<int> > Q;
void Topsort() {
  for (int i = 1; i <= n; ++i)
    if (!dg[i]) Q.push(i);
  while (!Q.empty()) {
    int u = Q.top();
    Q.pop();
    printf("%d\n", u);
    for (int i = h[u]; i; i = e[i].next)
      if (!--dg[e[i].v]) Q.push(e[i].v);
  }
}
int main() {
  n = read();
  K = read();
  for (int i = 1; i <= n; ++i) a[P[i] = read()] = i;
  for (int i = 1; i <= n; ++i)
    for (int j = i + 1; j <= n; ++j)
      if (abs(a[i] - a[j]) < K) Add(a[i], a[j]);
  Topsort();
  return 0;
}
