#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];

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

class InputReader {
    public:
        InputReader() {}
        InputReader(const char *file_name) {
            input_file = fopen(file_name, "r");
            cursor = 0;
            fread(buffer, SIZE, 1, input_file);
        }
        inline InputReader &operator >>(int &n) {
            while(buffer[cursor] < '0' || buffer[cursor] > '9') {
                advance();
            }
            n = 0;
            while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
                n = n * 10 + buffer[cursor] - '0';
                advance();
            }
            return *this;
        }
    private:
        FILE *input_file;
        static const int SIZE = 1 << 13;
        int cursor;
        char buffer[SIZE];
        inline void advance() {
            ++ cursor;
            if(cursor == SIZE) {
                cursor = 0;
                fread(buffer, SIZE, 1, input_file);
            }
        }
};



int main()
{
    int i,j;
    InputReader f("partitie.in");
    f>>n>>d;
    for (i=1;i<=n;i++) {
        f>>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;
    }
    freopen("partitie.out","w",stdout);
    printf("%d\n",sol);
    for (i=1;i<=n;i++)
        printf("%d\n",s[i]);
    return 0;
}