#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <vector>

using namespace std;

const int kmax = 1e6 + 3;

int n, k, a[kmax];
int ct;
int mx[2];
int f[kmax];

bool Check() {
  mx[0] = 0, mx[1] = -1e9;
  for(int i = 1; i <= n; i++) f[i] = 1e9;
  for(int i = 1, j = 0; i <= n; i++) {
    if(a[i] == 1) {
      for(f[i] = mx[0] + 1; j < i; j++) {
        mx[1] = max(mx[1], f[j]);
      }
    } else if(a[i] == 0) {
      f[i] = mx[1] + 1;
    } else {
      f[i] = f[i - 1] + 1;
    }
    mx[0] = max(mx[0], f[i]);
  }
  return f[n] >= k;
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> n >> k;
  for(int i = 1; i <= n; i++) cin >> a[i], ct += !a[i];
  if(ct >= k) {
    cout << 0 << '\n';
  } else if(!ct) {
    cout << 1 << '\n';
  } else if(Check()) {
    cout << 1 << '\n';
  } else {
    cout << 2 << '\n';
  }
  return 0;
}