#include <bits/stdc++.h>
using namespace std;
unsigned long long mod = 1e9 + 7;
unsigned long long ncr(long long n, long long k) {
  unsigned long long res = 1;
  if (k > n - k) k = n - k;
  for (long long i = 0; i < k; ++i) {
    res *= (n - i);
    res /= (i + 1);
    res = res;
  }
  return res;
}
bool prime(unsigned long long num) {
  bool flag = true;
  for (unsigned long long i = 2; i * i <= num; i++) {
    if (num % i == 0) {
      flag = false;
      break;
    }
  }
  return flag;
}
long long ipow(long long base, long long exp) {
  long long result = 1;
  for (;;) {
    if (exp & 1) {
      result *= base;
      result = result % mod;
    }
    exp >>= 1;
    if (!exp) break;
    base *= base;
    base = base % mod;
  }
  return result % mod;
}
long long abs(long long a, long long b) {
  if ((a - b) > 0)
    return (a - b);
  else
    return (b - a);
}
long long MOD = 998244353;
long long add(long long a, long long b) {
  a += b;
  if (a >= MOD) a -= MOD;
  if (a < 0) a += MOD;
  return a;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long der(long long k) {
  long long res = 0;
  long long fact = 1;
  for (long long i = 2; i <= k; i++) fact *= i;
  long long s = 1;
  long long j = 1;
  for (long long i = 2; i <= k; i++) {
    j = j * i;
    long long first = (fact / j) * s;
    res += first;
    s = s * -1;
  }
  return res;
}
int n, k;
vector<int> v;
int st;
bool check(int sum[], int val) {
  for (int i = 1; i <= n - val + 1; i++) {
    int z = val - sum[i + val - 1] + sum[i - 1];
    if (z <= k) {
      st = i;
      return true;
    }
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> k;
  int sum[n + 1];
  sum[0] = 0;
  for (long long i = 0; i < n; i++) {
    int x;
    cin >> x;
    v.push_back(x);
    sum[i + 1] = sum[i] + x;
  }
  int left = 1;
  int rht = n;
  int ans = 0;
  while (left <= rht) {
    int mid = (left + rht) / 2;
    if (check(sum, mid)) {
      left = mid + 1;
      ans = mid;
    } else {
      rht = mid - 1;
    }
  }
  cout << ans << endl;
  for (int i = st - 1; i < st + ans - 1; i++) v[i] = 1;
  for (long long i = 0; i < n; i++) cout << v[i] << " ";
}
