#include <fstream>
#include <algorithm>

using namespace std;
ifstream fin("partitie.in");
ofstream fout("partitie.out");
const int dim = 300000 + 5;
int sol[dim];
pair <int, int> v[dim];
bool cmp( pair<int, int> a, pair<int, int> b)
{
    return a.first < b.first;
}
int main()
{
    int n, i, j, m, k = 0;
    fin >> n >> m;
    for ( i = 1; i <= n; ++i )
        fin >> v[i].first, v[i].second = i;

    sort(v + 1, v + n + 1);
    j = 2;
    for ( i = 1; i <= n; ++i )
    {
        while ( j <= n && (sol[v[j].second] != 0 || v[j].first < v[i].first +  m) )
            ++j;
      //  fout << " j = " << j << endl;
        if ( j <= n )
        {
            if ( sol[v[i].second] == 0 )
                sol[v[i].second] = ++k;
            sol[v[j].second] = sol[v[i].second];
        }
        else
            if ( sol[i] == 0 )
                sol[i] = ++k;
    }
    fout << k << '\n';
    for ( i = 1; i <= n; ++i )
        fout << sol[i] << '\n';
    return 0;
}