#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

#define FIN "partitie.in"
#define FOUT "partitie.out"
#define MAX_N 300005

int A[MAX_N];
int pz[MAX_N];
int B[MAX_N];

int N, D, i, j;

    void part(int st,int dr, int &stst, int &stdr, int &drst, int &drdr)
    {
         int i, j, piv;
         int  aux;
         piv = A[(st+dr)/2];
         i = st - 1; j = dr + 1;
         while (i < j) {
            do {i++;} while (A[i] < piv);
            do {j--;} while (A[j] > piv);   
            if (i < j) 
            { 
                aux = A[i]; A[i] = A[j]; A[j] = aux; 
                aux = pz[i]; pz[i] = pz[j]; pz[j] = aux;
            }
         }
         stst = st; drdr = dr;
         if (i==j) { stdr = j - 1; drst = i + 1; }
             else { stdr = j; drst = i; }
    }

    void sort(int st, int dr)
    { 
         int stst, stdr, drst, drdr;
         if (st<dr)
         {
             part(st,dr,stst,stdr,drst,drdr);
             sort(stst,stdr);
             sort(drst,drdr);
         }
    }

    int main ()
    {
        freopen (FIN, "r", stdin);
        freopen (FOUT, "w", stdout);
        scanf ("%d %d", &N, &D);
        
        for (i = 1; i <= N; ++i) {
            pz[i] = i; scanf ("%d", A + i); }
        sort (1, N);
        
        int jant = 1, max = 0;
        for (i = 1; i < N; ++i)
        {
           for (j = jant; j <= N; ++j)
                if (A[j] - A[i] < D)
                {
                         jant = j; if (j - i + 1 > max) max = j - i + 1;
                }
                else break;
           if (max >= D) break;
        }
        printf ("%d\n", max);
        int cl = 1;
        for (i = 1; i <= N; ++i)
        {
            A[i] = cl; ++cl;
            if (cl > max) cl = 1;
        }
        
        for (i = 1; i <= N; ++i) B[pz[i]] = A[i];
        for (i = 1; i <= N; ++i) printf ("%d\n", B[i]);
        return 0;
    }