#include <stdio.h>
#include <algorithm>
#include <assert.h>
#include <set>

using namespace std;

#define PII pair<int, int>
#define maxim(a, b) ((a > b) ? a : b)
#define f first
#define s second
#define NMax 300005

int N, D, bst, ord[NMax];
PII v[NMax];
set<int> A;

int main(void)
{
    int i, j;
    
    freopen("partitie.in", "r", stdin);
    freopen("partitie.out", "w", stdout);

    scanf("%d %d", &N, &D);
    assert(D <= 1000000000);    
    for (i = 1; i <= N; i++)
    {
        scanf("%d", &v[i].f);
        v[i].s = i;
        A.insert(v[i].f);
        assert(1 <= v[i].f && v[i].f <= 1000000000);
    }
    assert(A.size() == N);
    
    sort(v+1, v+N+1);
    for (i = 1, j = 1; i <= N; i++)
    {
        for (; j <= N && v[j].f-v[i].f < D; j++);
        bst = maxim(bst, j-i);
    }

    for (i = 1, j = 0; i <= N; i++)
    {
        (j == bst) ? (j = 1) : (++j);
        ord[v[i].s] = j;
    }
    
    printf("%d\n", bst);
    for (i = 1; i <= N; i++)
        printf("%d\n", ord[i]);

    return 0;
}