#include "bits/stdc++.h"
using namespace std;
#ifndef LOCAL
#define endl '\n'
#endif

#define fr(i, a, b) for(int i = a; i <= b; i++)
#define rf(i, a, b) for(int i = a; i >= b; i--)
#define pf push_front
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound

typedef long long ll;
typedef long double f80;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int bt(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
int bt(ll x) { return 63 - __builtin_clzll(x); } // floor(log2(x))
int cdiv(int a, int b) { return a / b + !(a < 0 || a % b == 0); }
ll cdiv(ll a, ll b) { return a / b + !(a < 0 || a % b == 0); }
int nxt_C(int x) { int c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }
ll nxt_C(ll x) { ll c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }

vector<int> get_bits(int mask) {
	vector<int> bb;
	while(mask) { int b = bt(mask); bb.pb(b); mask ^= (1 << b); }
	reverse(all(bb));
	return bb;
}

int get_mask(vector<int> v) {
	int mask = 0;
	for(int x : v) { mask ^= (1 << x); }
	return mask;
}

template<typename T>
void uniq(vector<T> &v) { sort(all(v)); v.resize(unique(all(v)) - v.begin()); }

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

ll rand(ll l, ll r){
	uniform_int_distribution<ll> uid(l, r);
	return uid(rng);
}

void sc() {}

template <typename Head, typename... Tail>
void sc(Head &H, Tail &... T) { cin >> H; sc(T...); }

#ifdef LOCAL
#define debug(...) cerr << "[L:" << __LINE__ << "][" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

// #ifndef LOCAL
// string to_string(__int128 x) {
// 	string s = "";
// 	bool neg = 0;
// 	if(x < 0) { s += "-"; neg = 1; x = -x; }
// 	if(!x) s += '0';
// 	while(x) {
// 		int rem = x % 10;
// 		s += to_string(rem);
// 		x /= 10;
// 	}
// 	reverse(s.begin() + neg, s.end());
// 	return s;
// }
// #endif

const int mod = 1e9 + 7; // 998244353;

int pwr(int a,ll b) {
	int ans = 1;
	while(b) {
		if(b & 1) ans = (ans * 1LL * a) % mod;
		a = (a * 1LL * a) % mod;
		b >>= 1;
	}
	return ans;
}

/*
	Lookout for overflows!!
	Check array sizes!!
	Clear before test cases!!
	Use the correct modulo!!
	Check for corner cases!!
	Are you forgetting something?!
	Read problem statement carefully!!!
*/

template<class T, size_t MAXN> struct RMQ {
    int n;
    T st[MAXN << 1];
    void build(int n) {
        this->n = n;
        for (int i = n - 1; i > 0; i--) {
            st[i] = max(st[i << 1], st[i << 1 | 1]);
        }
    }
    void upd(int p, int val) {
        st[p += n] = val;
        for(; p > 1; p >>= 1) {
            st[p >> 1] = max(st[p], st[p ^ 1]);
        }
    }
    T query(int l, int r) { // [l, r]
        l = max(l, 1);
        r = min(r, n - 1);
        l += n, r += n + 1;
        T res = -1e9;
        for (; l < r; l >>= 1, r >>= 1) {
            if (l & 1) res = max(res, st[l++]);
            if (r & 1) res = max(res, st[--r]);
        }
        return res;
    }
};

const int N = 5e5 + 5;

int a[N];
vector<int> g[N];
int deg[N];
int pos[N];

void solve() {
	RMQ<int, N> seg;
    int n, k;
    sc(n, k);
    fr(i, 1, n) {
        sc(a[i]);
        pos[a[i]] = i;
        seg.st[n + 1 + i] = -1e9;
    }
    seg.build(n + 1);
    fr(i, 1, n) {
        int idx = seg.query(pos[i] - k + 1, pos[i] - 1);
        if(idx != -1e9) {
            g[pos[idx]].pb(pos[i]);
            deg[pos[i]]++;
        }
        idx = seg.query(pos[i] + 1, pos[i] + k - 1);
        if(idx != -1e9) {
            g[pos[idx]].pb(pos[i]);
            deg[pos[i]]++;
        }
        seg.upd(pos[i], i);
    }
    set<int> q;
    fr(i, 1, n) {
        if(!deg[i]) {
            q.insert(i);
        }
    }
    int c = 0;
    vector<int> ans(n + 1);
    while(!q.empty()) {
        int u = *q.begin();
        q.erase(q.begin());
        ans[u] = ++c;
        for(int v : g[u]) {
            deg[v]--;
            if(!deg[v]) q.insert(v);
        }
    }
    fr(i, 1, n) {
        cout << ans[i] << endl;
    }
}

int main() {
	ios :: sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	// cin >> t;
	for(int tt = 1; tt <= t; tt++) {
		solve();
	}
	return 0;
}

Measured memory_bytes: 48884