#include<stdio.h>
#define MAXN 300001
long n,i,j,max,d,maxd,x;
long a[MAXN],sol[MAXN],nr[MAXN];
long poz(long li,long ls)
{
long t=0,i,j,aux;
i=li;
j=ls;
while(i<j)
{
if(a[nr[i]]>a[nr[j]])
{
aux=nr[i];
nr[i]=nr[j];
nr[j]=aux;
t=1-t;
}
if(t)
j--;
else
i++;
}
return i;
}
void quick(long li,long ls)
	{
	long k;
	if(li<ls)
	{
		k=poz(li,ls);
		quick(li,k-1);
		quick(k+1,ls);
	}
	}
int main(void)
	{
	freopen("partitie.in","r",stdin);
	freopen("partitie.out","w",stdout);
	scanf("%ld%ld",&n,&d);
	for(i=1;i<=n;i++)
		{
		scanf("%ld",&a[i]);
		nr[i]=i;
		}
	quick(1,n);
	maxd=2;
	for(i=1;i<=n;i++)
	{
		j=maxd;
		while(a[nr[j]]-d<a[nr[i]]&&j<=n)
			j++;
		if(j-i>max)
		max=j-i;
		maxd=j;
	}

printf("%ld\n",max);

for(i=1,x=1;i<=n;i++,x++)
	{
		if(x>max)
			x-=max;
		sol[nr[i]]=x;
	}
for(i=1;i<=n;i++)
printf("%ld\n",sol[i]);
return 0;
}