#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

struct BIT { //0-origin!!! update and get just like lazy_segtree
	int n; vl bit0, bit1;
	void init(int mx) {
		n = mx;
		bit0 = vl(n + 1, 0); bit1 = vl(n + 1, 0);
	}
	BIT(int mx = 0) { init(mx); } 

	ll ga(vl& bit, int i) {
		ll s = 0;
		while(i > 0) { s += bit[i]; i -= i & -i; }
		return s;
	}
	void app(vl& bit, int i, ll x) {
		while(i <= n) { bit[i] += x; i += i & -i; }
	}
	void update(int a, int b, ll x) { //[a, b)
		a++;
		app(bit0, a, -x * (a - 1));
		app(bit1, a, x);
		app(bit0, b + 1, x * b);
		app(bit1, b + 1, -x);
	}
	ll get(int a, int b) { //[a, b)
		a++;
		return (ga(bit1, b) * b + ga(bit0, b)) 
			- (ga(bit1, a - 1) * (a - 1) + ga(bit0, a - 1));
	}
};

struct BITB { //1-origin!!!
	int n, b; vl bit;
	void init(int mx) {
		n = mx;
		b = 1;
		while(b * 2 <= n) b *= 2;
		bit = vl(n + 1, 0);
	}
	BITB(int mx = 0) { init(mx); } 

	ll get(int i) {
		ll s = 0;
		while(i > 0) { s += bit[i]; i -= i & -i; }
		return s;
	}
	void update(int i, ll x) {
		while(i <= n) { bit[i] += x; i += i & -i; }
	}

	int get_index(ll x) { //something like lower_bound(all(sum), a). O(logn)
		x--;
		int r = b;
		int res = 0;
		while(r > 0) {
			if((r | res) <= n) {
				int rv = bit[r | res];
				if(x >= rv) {
					x -= rv;
					res += r;
				}
			}
			r >>= 1;
		}
		return res + 1;
	}

	int range_sum(int a, int b) { //[a, b]
		return get(b) - get(a - 1);
	}
};

int N, K;
int A[MAX_N];
int G[MAX_N];
int D[MAX_N];
int F[MAX_N];
pi Q[MAX_N];

int loop(int v) {
	if(F[v] != -1) return F[v];
	int res = D[v];
	if(G[v] != v) {
		res += loop(G[v]);
	}
	return F[v] = res;
}

void solve() {
	cin >> N >> K;
	rep(i, 0, N) {
		cin >> A[i];
		A[i]--;
	}
	set<pi> S;
	rep(i, 0, K) S.insert(pi(-A[i], i));
	rep(i, 0, N) {
		auto it = S.upper_bound(pi(-A[i], i));
		if(it == S.end()) {
			G[i] = i;
			Q[A[i]] = pi(i, i + 1);
		}
		else {
			G[i] = (*it).sec;
			Q[A[i]] = pi(i, G[i]);
		}
		S.erase(pi(-A[i], i));
		if(i + K < N) S.insert(pi(-A[i + K], i + K));
	}
	BIT bit(N);
	rep(i, 0, N) {
		bit.update(Q[i].fst, Q[i].fst + 1, 1);
		D[Q[i].fst] = bit.get(Q[i].fst, Q[i].sec);
	}
	memset(F, -1, sizeof(F));
	rep(i, 0, N) loop(i);
	// debug(vi(G, G + N));
	// debug(vi(D, D + N));
	// debug(vi(F, F + N));
	BITB bb(N);
	rep(i, 0, N) bb.update(i + 1, 1);
	rep(i, 0, N) {
		int a = bb.get_index(F[i]);
		cout << a << "\n";
		bb.update(a, -1);
	}
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}



Measured memory_bytes: 42624