#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("partitie.in");
ofstream fout("partitie.out");
int n, d, nrp, sol[300002];
struct last_place{
    int valoare, pozitie;
}lp[300002];
struct element
{
    int val, poz;
} v[300002];
inline bool cmp(const element a, const element b)
{
    return a.val<b.val;
}
inline bool ccmp(const last_place a, const last_place b)
{
    return a.valoare<b.valoare;
}
int bs(int val)
{
    int st=1, dr=nrp, mijl, sol=-1;
    while(st<=dr)
    {
        mijl=st+(dr-st)/2;
        if(val-lp[mijl].valoare>=d) sol=mijl, st=mijl+1;
        else dr=mijl-1;
    }
    return sol;
}
int main()
{
    int i, pozi;
    fin>>n>>d;
    for(i=1; i<=n; i++)
    {
        fin>>v[i].val;
        v[i].poz=i;
    }
    sort(v+1,v+n+1,cmp);
    for(i=1; i<=n; i++)
    {
        pozi=bs(v[i].val);
        if(pozi==-1)
        {
            lp[++nrp].valoare=v[i].val;
            lp[nrp].pozitie=nrp;
            sol[v[i].poz]=nrp;
        }
        else
        {
            lp[pozi].valoare=v[i].val;
            sol[v[i].poz]=lp[pozi].pozitie;
            sort(lp+1,lp+nrp+1,ccmp);
        }
    }
    fout<<nrp<<'\n';
    for(i=1; i<=n; i++)
        fout<<sol[i]<<'\n';
    return 0;
}