#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("partitie.in");
ofstream fout("partitie.out");
int n, d, nrp, sol[300002], lp[300002];
struct element
{
    int val, poz;
} v[300002];
inline bool cmp(const element a, const element b)
{
    return a.val<b.val;
}
int main()
{
    int i, j;
    bool ok;
    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++)
    {
        ok=0;
        if(v[i].val-v[1].val>=d)
        {
            for(j=1; j<=nrp; j++)
                if(v[i].val-lp[j]>=d)
                {
                    lp[j]=v[i].val;
                    sol[v[i].poz]=j;
                    ok=1;
                    break;
                }
        }
        if(ok==0)
        {
            lp[++nrp]=v[i].val;
            sol[v[i].poz]=nrp;
        }
    }
    fout<<nrp<<'\n';
    for(i=1; i<=n; i++)
        fout<<sol[i]<<'\n';
    return 0;
}