#include<bits/stdc++.h>
#define N 2000005
#define INF 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
#define pii pair<int,int>
#define MP make_pair
#define lb(x) ((x)&-(x))
using namespace std;
int n,K,a[N],f[N];
struct BIT1{ int T[N]={0};
	void cl(){for(int i=0;i<=n+1;i++) T[i]=-INF;}
	void add(int x,int d){x++; for(int i=x;i<=n+1;i+=lb(i)) T[i]=max(T[i],d);}
	int ask(int x){ if(x<0) return -INF;
		x++; int ret=-INF; for(int i=x;i;i-=lb(i)) ret=max(ret,T[i]); return ret;} 
}T1;
struct BIT2{ int T[N]={0};
	void cl(){for(int i=0;i<=n+1;i++) T[i]=-INF;}
	void add(int x,int d){x++; for(int i=x;i;i-=lb(i)) T[i]=max(T[i],d);}
	int ask(int x){ if(x<0) return -INF;
		x++; int ret=-INF; for(int i=x;i<=n+1;i+=lb(i)) ret=max(ret,T[i]); return ret;}
}T2;
signed main(){
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	scanf("%d%d",&n,&K); int c0=0,c00=0;
	for(int i=1;i<=n;i++) scanf("%d",&a[i]),c00+=(a[i]>0),c0+=(a[i]==0);
	if(c0>=K) return !printf("0");
	memset(f,0xcf,sizeof(f));
	f[0]=0,T1.cl(),T2.cl(),T1.add(0,0),T2.add(0,0);
	for(int i=1,m0=0,m1=0;i<=n;i++){
		if(a[i]==0) m0=i; if(a[i]==1) m1=i;
		if(m0&&m1) f[i]=max(f[i],T1.ask(min(m0,m1)-1)+1);
		f[i]=max(f[i],T2.ask(m0)+1);
		if(!m0&&!m1) f[i]=i;
		T1.add(i,f[i]),T2.add(i,f[i]);
	}if(f[n]>=K||c00==n) return !printf("1");
	return !printf("2");
}