#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <string.h>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <numeric>
#include <cctype>
#include <bitset>
#include <cassert>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define gep(i,g,j) for(int i = g.head[j]; i != -1; i = g.e[i].next)
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcount
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define df(x) int x = in()
#define dame { puts("0"); return 0;}
#define show(x) cout<<#x<<" = "<<x<<endl;
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
inline void priv(vi a) { rep(i,sz(a)) printf("%d%c",a[i],i==sz(a)-1?'\n':' ');}
template<typename T>istream& operator>>(istream&i,vector<T>&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(vector<T>&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>ostream& operator<<(ostream&o,pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}

const int MX = 100005, INF = 1001001001;
const ll LINF = 1e18;
const double eps = 1e-10;

int n, k;
vi p, a, ans;

priority_queue<int> q;
struct seg {
  vi d, e; int x2;
  seg(){}
  seg(int mx) {
    x2 = 1; while(x2 < mx) x2 <<= 1;
    d = vi(x2<<1);
    e = vi(x2<<1, INF);
  }
  void sp(int i) {
    d[i<<1] += d[i]; e[i<<1] += d[i];
    d[i<<1|1] += d[i]; e[i<<1|1] += d[i];
    d[i] = 0;
  }
  // 0 -> reset, otherwise -> add
  void add(int a, int b, int x) {
    add(max(0,a), min(b,n), x, 1, 0, x2);
  }
  void add(int a, int b, int x, int i, int l, int r){
    if(a <= l && r <= b) {
      if (x) {
        d[i] += x;
        e[i] += x;
      } else {
        d[i] = e[i] = 0;
      }
      return;
    }
    sp(i);
    int c = (l+r)>>1;
    if(a < c) add(a,b,x,i<<1,l,c);
    if(c < b) add(a,b,x,i<<1|1,c,r);
    e[i] = min(e[i<<1], e[i<<1|1]);
  }
  void push(int i=1) {
    if (e[i]) return;
    if (i >= x2) {
      q.push(i-x2);
      d[i] = e[i] = INF;
      return;
    }
    sp(i);
    push(i<<1);
    push(i<<1|1);
    e[i] = min(e[i<<1], e[i<<1|1]);
  }
};

void solve() {
  seg t(n+2);
  rep(i,n) {
    t.add(a[i]-k+1, a[i]+k, 1);
    t.add(a[i], a[i]+1, 0);
  }
  t.push();
  while (sz(q)) {
    int i = q.top(); q.pop();
    ans.pb(i);
    t.add(i-k+1, i+k, -1);
    t.push();
  }
}

int main() {
  scanf("%d%d",&n,&k);
  p = a = vi(n);
  rep(i,n) scanf("%d",&p[i]), --p[i];
  rep(i,n) a[p[i]] = i;
  solve();
  assert(sz(ans) == n);
  reverse(rng(ans));
  rep(i,n) p[ans[i]] = i;
  for (int x : p) printf("%d\n",x+1);
  return 0;
}







Measured memory_bytes: 17392