#include <bits/stdc++.h>
using namespace std;
int n,k,a[1000050],pre[1000050],nxt[1000050],pl[1000050],top,posa,posb,cnt,ans[1000050];
int main()
{
	scanf("%d%d",&n,&k);
	for (int i = 1;i <= n;i++)
	{
		scanf("%d",a + i);
		pre[i] = i - 1;
		nxt[i] = i + 1;
		pl[a[i]] = i;
	}
	pre[1] = n;
	nxt[n] = 1;
	top = n;
	while (top)
	{
		if (pl[top] != -1)
		{
			cnt++;
//			printf("%d ",pl[top]);
			posa = posb = pl[top];
			ans[pl[top]] = cnt;
			pl[top] = -1;
			for (int i = 1;i <= k;i++)
			{
				posa = pre[posa];
				if (pl[a[posa]] == -1)
					break;
				pl[a[posa]] = -1;
				ans[posa] = cnt;
//				printf("%d ",posa);
			}
			for (int i = 1;i <= k;i++)
			{
				posb = nxt[posb];
				if (pl[a[posb]] == -1)
					break;
				pl[a[posb]] = -1;
				ans[posb] = cnt;
//				printf("%d ",posb);
			}
//			printf("\n");
			int x = pre[posa],y = nxt[posb];
			nxt[x] = y;
			pre[y] = x;
		}
		top--;
	}
	for (int i = 1;i <= n;i++)
		printf("%d ",ans[i]);
	return 0;
}