#include"fstream.h"
#include"math.h"

int c[30010];
int main()
{
 ifstream fin("partitie.in");
 ofstream fout("partitie.out");

 long n,d,v[30010],i,j,max=0;
 fin>>n>>d;
 for(i=1;i<=n;++i)
    fin>>v[i];

 for(i=1;i<n;++i)
   for(j=i+1;j<=n;++j)
       if(c[i]==c[j])          //daca sunt in aceeasi submultime
	 {
	   if(abs(v[i]-v[j])<d)
	       {
		c[j]++;
		if(c[j]>max)
		    max=c[j];
		}
	 }
	else
	  ;

 fout<<max+1<<"\n";
 for(i=1;i<=n;++i)
    fout<<c[i]+1<<"\n";


 fin.close();
 fout.close();
 return 0;

}