#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 1007681537;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-9;
inline long long gcd(long long a, long long b) {
  long long r;
  while (b) {
    r = a % b;
    a = b;
    b = r;
  }
  return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
inline long long fpow(long long n, long long k, int p = MOD) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
template <class T>
inline int chkmin(T& a, const T& val) {
  return val < a ? a = val, 1 : 0;
}
template <class T>
inline int chkmax(T& a, const T& val) {
  return a < val ? a = val, 1 : 0;
}
inline long long isqrt(long long k) {
  long long r = sqrt(k) + 1;
  while (r * r > k) r--;
  return r;
}
inline long long icbrt(long long k) {
  long long r = cbrt(k) + 1;
  while (r * r * r > k) r--;
  return r;
}
inline void addmod(int& a, int val, int p = MOD) {
  if ((a = (a + val)) >= p) a -= p;
}
inline void submod(int& a, int val, int p = MOD) {
  if ((a = (a - val)) < 0) a += p;
}
inline int mult(int a, int b, int p = MOD) { return (long long)a * b % p; }
inline int inv(int a, int p = MOD) { return fpow(a, p - 2, p); }
inline int sign(long double x) { return x < -EPS ? -1 : x > +EPS; }
inline int sign(long double x, long double y) { return sign(x - y); }
const int maxn = 1e5 + 5;
int n, k;
pair<int, int> a[maxn];
void solve() {
  cin >> n >> k;
  for (int i = (0); i < (n); i++) cin >> a[i].first, a[i].second = i;
  sort(a, a + n);
  int magic = min(6, n - 1);
  pair<int, pair<vector<pair<int, int> >, vector<pair<int, int> > > > best;
  best.first = INF;
  for (int msk = (0); msk < (1 << magic); msk++) {
    vector<pair<int, int> > v1, v2;
    for (int i = (0); i < (n); i++) {
      if (i < magic && (((msk) >> (i)) & 1)) {
        v1.push_back(a[i]);
      } else {
        v2.push_back(a[i]);
      }
    }
    int mx = a[n - 2].first + a[n - 1].first, mn = a[0].first + a[1].first + k;
    if (int((v1).size()) && int((v2).size())) {
      chkmax(mx, v1.back().first + v2.back().first + k);
      chkmin(mn, v1[0].first + v2[0].first + k);
    }
    if (int((v1).size()) > 1) {
      chkmin(mn, v1[0].first + v1[1].first);
    }
    if (int((v2).size()) > 1) {
      chkmin(mn, v2[0].first + v2[1].first);
    }
    chkmin(best, make_pair(mx - mn, make_pair(v1, v2)));
  }
  static int ans[maxn];
  for (int i = (0); i < (int((best.second.first).size())); i++) {
    ans[best.second.first[i].second] = 1;
  }
  cout << best.first << "\n";
  for (int i = (0); i < (n); i++) cout << ans[i] + 1 << " \n"[i == n - 1];
}
int main(int argc, char* argv[]) {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int JUDGE_ONLINE = 1;
  if (argc > 1) {
    JUDGE_ONLINE = 0;
    assert(freopen(argv[1], "r", stdin));
  }
  if (argc > 2) {
    JUDGE_ONLINE = 0;
    assert(freopen(argv[2], "w", stdout));
  }
  solve();
  if (!JUDGE_ONLINE) {
    cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  }
  return 0;
}
