#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9 + 7;
const long long N = 2e5 + 5;
long long n, k, flag = 0;
pair<long long, long long> A[N];
long long B[N], C[N], ans, cur;
void fun(long long a, long long b, long long c, long long d, long long e) {
  if (max(A[d].first + A[e].first, A[e].first + A[a].first + k) -
          min(A[b].first + A[c].first, A[a].first + A[b].first + k) <
      ans)
    ans = max(A[d].first + A[e].first, A[e].first + A[a].first + k) -
          min(A[b].first + A[c].first, A[a].first + A[b].first + k),
    cur = A[a].second;
}
long long solve() {
  long long i, j, x = 0, y = 0;
  cin >> n >> k;
  for (i = 1; i <= n; i++) cin >> A[i].first, A[i].second = i;
  sort(A + 1, A + n + 1);
  ans = A[n].first + A[n - 1].first - A[1].first - A[2].first;
  cur = 0;
  if (n == 2) {
    cout << 0 << "\n";
    for (i = 1; i <= 2; i++) cout << 2 << " ";
    return 0;
  }
  ans = A[n].first + A[n - 1].first - A[1].first - A[2].first;
  cur = 0;
  fun(1, 2, 3, n - 1, n);
  fun(2, 1, 3, n - 1, n);
  fun(n - 1, 1, 2, n - 2, n);
  fun(n, 1, 2, n - 2, n - 1);
  cout << ans << "\n";
  for (i = 1; i <= n; i++)
    if (i == cur)
      cout << 1 << " ";
    else
      cout << 2 << " ";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1, i;
  while (t--) {
    solve();
  }
}
