Reminder: in case of any technical issues, you can use the lightweight website
m1.codeforces.com,
m2.codeforces.com,
m3.codeforces.com.
×

Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Boring Partition

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThis problem is the most boring one you've ever seen.

Given a sequence of integers *a*_{1}, *a*_{2}, ..., *a*_{n} and a non-negative integer *h*, our goal is to partition the sequence into two subsequences (not necessarily consist of continuous elements). Each element of the original sequence should be contained in exactly one of the result subsequences. Note, that one of the result subsequences can be empty.

Let's define function *f*(*a*_{i}, *a*_{j}) on pairs of distinct elements (that is *i* ≠ *j*) in the original sequence. If *a*_{i} and *a*_{j} are in the same subsequence in the current partition then *f*(*a*_{i}, *a*_{j}) = *a*_{i} + *a*_{j} otherwise *f*(*a*_{i}, *a*_{j}) = *a*_{i} + *a*_{j} + *h*.

Consider all possible values of the function *f* for some partition. We'll call the goodness of this partiotion the difference between the maximum value of function *f* and the minimum value of function *f*.

Your task is to find a partition of the given sequence *a* that have the minimal possible goodness among all possible partitions.

Input

The first line of input contains integers *n* and *h* (2 ≤ *n* ≤ 10^{5}, 0 ≤ *h* ≤ 10^{8}). In the second line there is a list of *n* space-separated integers representing *a*_{1}, *a*_{2}, ..., *a*_{n} (0 ≤ *a*_{i} ≤ 10^{8}).

Output

The first line of output should contain the required minimum goodness.

The second line describes the optimal partition. You should print *n* whitespace-separated integers in the second line. The *i*-th integer is 1 if *a*_{i} is in the first subsequence otherwise it should be 2.

If there are several possible correct answers you are allowed to print any of them.

Examples

Input

3 2

1 2 3

Output

1

1 2 2

Input

5 10

0 1 0 2 1

Output

3

2 2 2 2 2

Note

In the first sample the values of *f* are as follows: *f*(1, 2) = 1 + 2 + 2 = 5, *f*(1, 3) = 1 + 3 + 2 = 6 and *f*(2, 3) = 2 + 3 = 5. So the difference between maximum and minimum values of *f* is 1.

In the second sample the value of *h* is large, so it's better for one of the sub-sequences to be empty.

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/08/2020 19:00:42 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|