#include<stdio.h>
#include<algorithm>

#define maxn 300005

using namespace std;

FILE*f=fopen("partitie.in","r");
FILE*g=fopen("partitie.out","w");

int n,D;
int mult[maxn],sol[maxn];
pair<int,int>v[maxn];

int main () {
	
	fscanf(f,"%d %d",&n,&D);
	for ( int i = 1 ; i <= n ; ++i ){
		fscanf(f,"%d",&v[i].first);
		v[i].second = i;
	}
	
	sort(v+1,v+n+1);
	
	int u = 1;
	for ( int i = 1 ; i <= n ; ++i ){
		
		while ( u < n && (mult[u] || v[u].first-v[i].first < D) ){
			++u;
		}
		
		if ( !mult[i] )	mult[i] = ++mult[0];
		if ( !mult[u] && v[u].first-v[i].first >= D ){
			mult[u] = mult[i];
		}
	}
	
	for ( int i = 1 ; i <= n ; ++i ){
		sol[v[i].second] = mult[i];
	}
	
	fprintf(g,"%d\n",mult[0]);
	for ( int i = 1 ; i <= n ; ++i ){
		fprintf(g,"%d\n",sol[i]);
	}
	
	fclose(f);
	fclose(g);
	
	return 0;
}