#include<cstdio>
#include<algorithm>
using namespace std;
const int N=1<<19;
int nri,n,d,a[N],p[N],v[N];
void read()
{
    freopen("partitie.in","r",stdin);
    freopen("partitie.out","w",stdout);
    scanf("%d%d",&n,&d);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&v[i]);
        p[i]=i;
    }
}
bool comp(int X,int Y)
{
    return (v[X]<v[Y]);
}
int maxim(int x,int y)
{
    return x>y?x:y;
}
void solve()
{
    sort(p+1,p+n+1,comp);
    int j=1;
    for(int i=1;i<=n;i++)
    {
        while(j<=n)
        {
            if(v[p[i]]-v[p[j]]<d)
                break;
            j++;
        }
        nri=maxim(nri,i-j+1);
    }
    printf("%d\n",nri);
    for(int i=1;i<=n;i++)
        a[p[i]]=i%nri;
}
void afis(int a[N])
{
    for(int i=1;i<=n;i++)
        printf("%d\n",a[i]+1);
}
int main()
{
    read();
    solve();
    afis(a);
    return 0;
}