#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
int n, k, idx[1000050], maxn, len, tmp;
struct node1
{
	int pre, data, nxt;
}a[1000050];
struct node2
{
	int id;
	bool vis;
}b[1000050];
int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    while(ch < '0' || ch > '9')
    {
     	if(ch == '-')
     		f = -1;
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9')
    {
     	x = (x << 3) + (x << 1) + (ch ^ 48);
        ch = getchar();
    }
    return x * f;
}
int main()
{
 	#ifndef ONLINE_JUDGE
//		freopen("输入.in","r",stdin);
//		freopen("输出.out","w",stdout);
    #endif
    n = read(), k = read();
    maxn = n, len = n;
    for(int i = 1 ; i <= n ; i++)
    {
    	a[i].data = read(), a[i].pre = i - 1, a[i].nxt = i + 1;
    	b[a[i].data].vis = true, b[a[i].data].id = i;
	}
	a[1].pre = n, a[n].nxt = 1;
	while(len)
	{
		tmp++;
		if(len < 2 * k + 1)
		{
			for(int i = 1 ; i <= n ; i++)
				if(!idx[i])
					idx[i] = tmp;
			len = 0;
		}
		else
		{
			while(!b[maxn].vis)
				maxn--;
			int pos = b[maxn].id, temp, l, r;
			b[maxn].vis = false;
			idx[pos] = tmp;		
			temp = pos;
			for(int i = 1 ; i <= k ; i++)
			{
				temp = a[temp].pre;
				idx[temp] = tmp;
				b[a[temp].data].vis = false;
			}
			l = a[temp].pre;	
			temp = pos;
			for(int i = 1 ; i <= k ; i++)
			{
				temp = a[temp].nxt;
				idx[temp] = tmp;
				b[a[temp].data].vis = false;
			}
			r = a[temp].nxt;
			a[l].nxt = r, a[r].pre = l;
			len -= 2 * k + 1;			
		}		
	}
	for(int i = 1 ; i <= n ; i++)
		printf("%d%c", idx[i], " \n"[i == n]);
 	return 0;
}