#include<bits/stdc++.h>
using namespace std;
int n,k,ans;
int sms[1000010]={0};
int a[1000010]={0};

void pd()
{
    int sum,i,j;
    for(i=1;i<=n-k+1;i++)
    {
        sum=0;
        for(j=0;j<k;j++)
        {
            sum=sum+a[j+i];
        }
        if(sum!=sms[i])
        {
            return;
        }
    }
    ans=ans+1;
    return;
}
void dfs(int x)
{
    if(x>n)
    {
        pd();
        return;
    }
    a[x]=true;
    dfs(x+1);
    a[x]=false;
    dfs(x+1);
    return;
}
int main()
{
    freopen("Binaria.in","r",stdin);
    freopen("Binaria.out","w",stdout);
    int i,j;
    cin>>n>>k;
    for(i=1;i<=n-k+1;i++)
    {
        cin>>sms[i];
    }
    dfs(1);
    cout<<ans;
    return 0;
}