#include <cstdio>
#include <algorithm>
#define nmax 300005
using namespace std;
struct nod
{int a;int b;} v[nmax];
int n,d,sol;
int s[nmax];

bool cmp(const nod &a,const nod &b)
{
    return a.a<b.a;
}

int main()
{
    freopen("partitie.in","r",stdin);
    freopen("partitie.out","w",stdout);
    int i,j;
    scanf("%d %d",&n,&d);
    for (i=1;i<=n;i++) {
        scanf("%d",&v[i].a);
        v[i].b=i;
    }
    sort(v+1,v+n+1,cmp);

    i=1;j=1;
    while (i<=n) {
        while (j<=n&&v[j].a-v[i].a<d)
            j++;
        sol=max(sol,j-i);
        i++;
    }
    for (i=1,j=0;i<=n;i++) {
        s[v[i].b]=++j;
        if (j>=sol)
            j=0;
    }
    printf("%d\n",sol);
    for (i=1;i<=n;i++)
        printf("%d\n",s[i]);
    return 0;
}