#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#define maxN 300002
using namespace std;
int n, i, j, d, m, w[maxN];
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 << 17;
    int cursor;
    char buffer[SIZE];
    inline void advance()
    {
        ++ cursor;
        if(cursor == SIZE)
        {
            cursor = 0;
            fread(buffer, SIZE, 1, input_file);
        }
    }
};

struct el
{
    int x, y;
}v[maxN];
int cmp(const el a, const el b)
{
    return a.x < b.x;
}
struct comp
{
    bool operator() (const int &X, const int &Y)
    {
        return v[X].x > v[Y].x;
    }
};
priority_queue < int, vector < int >, comp> q;
void read()
{
    InputReader cin("partitie.in");
    cin >> n >> d;
    for (i = 1; i <= n; ++ i)
    {
        cin >> v[i].x;
        v[i].y = i;
    }
}
void solve()
{
    sort(v + 1, v + n + 1, cmp);
    for (i = 1; i <= n; ++ i)
    {
        if (q.empty() || (!q.empty() && v[q.top()].x + d > v[i].x))
        {
            ++ m;
            q.push(i);
            w[v[i].y] = m;
        }
        else
        {
            w[v[i].y] = w[v[q.top()].y];
            q.pop();
            q.push(i);
        }
    }
}
void write()
{
    freopen("partitie.out", "w", stdout);
    printf("%d\n", m);
    for (i = 1; i <= n; ++ i)
        printf("%d\n", w[i]);
}
int main()
{
    read();
    solve();
    write();
    return 0;
}