Hard Process

Description:

Input:

The first line contains two integers n and k (1 ≤ n ≤ 3·10⁵, 0 ≤ k ≤ n) — the number of elements in a and the parameter k.

The second line contains n integers a_i (0 ≤ a_i ≤ 1) — the elements of a.

Output:

On the first line print a non-negative integer z — the maximal value of f(a) after no more than k changes of zeroes to ones.

On the second line print n integers a_j — the elements of the array a after the changes.

If there are multiple answers, you can print any one of them.

Sample Input:

7 1
1 0 0 1 1 0 1

Sample Output:

4
1 0 0 1 1 1 1

Sample Input:

10 2
1 0 0 1 0 1 0 1 0 1

Sample Output:

5
1 0 0 1 1 1 1 1 0 1