#include<bits/stdc++.h>
using namespace std;
int n,k,ans,a[12];
int main(){
	freopen("Binaria.in","r",stdin);
	freopen("Binaria.out","w",stdout);
	scanf("%d%d",&n,&k);
	for(int i = 0;i<=n-k;i++) scanf("%d",&a[i]);
	for(int s=0;s<(1<<n);s++){
		int flag=1;
		for(int i = 0;i<=n-k;i++){
			int sum=0;
			for(int p =i;p<i+k;p++)
			sum+=(s>>p)&1;
			if(sum!=a[i]){flag=0; break;}
		}
		if(flag) ans++;
	}
	printf("%d",ans);
	return 0;
}