cf Hard Process

You are given an array a with n elements. Each element of a is either 0 or 1.

Let's denote the length of the longest subsegment of consecutive elements in a, consisting of only numbers one, as f(a). You can change no more than k zeroes to ones to maximize f(a).

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.

Example

Input

7 1
1 0 0 1 1 0 1

Output

4
1 0 0 1 1 1 1

Input

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

Output

5
1 0 0 1 1 1 1 1 0 1

#include<stdio.h>
#include<algorithm>
#include<deque>
using namespace std;
int a[1000003];
int sum[1000001];
int main()
{
    int n,k;
    while(~scanf("%d%d",&n,&k))
    {
        int num;
        sum[0]=0;
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&a[i]);
            sum[i]=sum[i-1]+a[i];
        }
        int ans=0,t1,t2;
        for(int i=1; i<=n; i++)
        {
            int l=i,r=n;
            while(l<=r)
            {
                int mid=(l+r)>>1;
                if(mid-i+1<=k+sum[mid]-sum[i-1])
                    l=mid+1;
                else
                    r=mid-1;
            }
            int pos=r;
            if(pos-i+1>ans)
            {
                ans=pos-i+1;
                t1=i;
                t2=pos;
            }
        }
        printf("%d\n",ans);
        for (int i = t1; i <= t2; i ++) a[i] = 1;
        for (int i = 1; i <= n; i ++)
           printf("%d ", a[i]);
        printf("\n");
    }
}