#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int inf = 1000000009;
const int MOD = 1000000007;
int i, j, k, m, t, n, h, a[100005], ans, w[100005], at[100005];
pair<int, int> p[100005];
int main() {
  cin >> n >> h;
  for (i = 0; i < n; i++) scanf("%d", &a[i]);
  ans = inf;
  if (n <= 10) {
    for (int mask = 0; mask < (1 << n); mask++) {
      for (i = 0; i < n; i++)
        if ((1 << i) & mask)
          at[i] = 1;
        else
          at[i] = 2;
      vector<int> v;
      for (i = 0; i < n; i++)
        for (j = i + 1; j < n; j++)
          v.push_back(a[i] + a[j] + h * (at[i] != at[j]));
      sort(v.begin(), v.end());
      if (v.back() - v[0] < ans) {
        ans = v.back() - v[0];
        for (i = 0; i < n; i++) w[i] = at[i];
      }
    }
  } else {
    for (i = 0; i < n; i++) {
      p[i].first = a[i];
      p[i].second = i;
    }
    sort(p, p + n);
    for (i = 0; i < n; i++) a[i] = p[i].first;
    ans = a[n - 1] + a[n - 2] - a[0] - a[1];
    for (i = 0; i < n; i++) w[p[i].second] = 2;
    int best = -1;
    for (i = n - 2; i >= 0; i--) {
      int ma = max(a[i] + a[n - 1] + h, a[n - 2] + a[n - 1]);
      int mi;
      if (i == 0) {
        mi = min(a[1] + a[2], a[0] + a[1] + h);
      } else {
        mi = min(a[0] + a[1] + h, a[0] + a[2]);
      }
      if (ma - mi < ans) {
        ans = ma - mi;
        best = i;
      }
    }
    if (best != -1) {
      for (i = best + 1; i < n; i++) w[p[i].second] = 2;
      for (i = 2; i <= best; i++) w[p[i].second] = 1;
      if (i == 0)
        ;
      else if (i == 1) {
        w[p[0].second] = 2;
      } else {
        w[p[0].second] = 1;
        w[p[1].second] = 2;
      }
    }
  }
  cout << ans << endl;
  for (i = 0; i < n; i++) printf("%d ", w[i]);
  return 0;
}
