// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
#define int long long
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

int pow(int a,int b){
    if(b==0)return 1;
    if(b%2==1)return (pow(a,b-1)*a)%(int)(1e9+7);
    int x=pow(a,b/2);
    return (x*x)%(int)(1e9+7);
}

signed main() {
    int n,k;cin>>n>>k;
    k--;
    vector<int> v(n),pref(n);
    for(int i = 0;i<n;i++){
        cin>>v[i];
        pref[i]=v[i];
        if(i>0)pref[i]+=pref[i-1];
    }
    int indtillforced=k;
    for(int i = k-1;i>=0;i--){
        if(pref[k]-pref[i]>=pref[i]){
            indtillforced=i+1;
            break;
        }
    }
    int w1=pow(2,indtillforced);
    vector<int> dp(n+2),dppref(n+2);
    dp[n]=1;
    dppref[n]=1;
    int j = n-1;
    for(int i = n-1;i>k;i--){
        while(j>=i&&pref[j]-pref[i-1]>=pref[i-1])j--;
        if(j<i)dp[i]=0;
        else dp[i]=(dppref[i+1]-dppref[j+2]+(j==n-1?1:0))%(int)(1e9+7);
        dppref[i]=(dp[i]+dppref[i+1])%(int)(1e9+7);
    }
    int w2=2;
    if(k!=n-1)w2=dp[k+1];
    /*for(int i : dp)cout<<i<<' ';
    cout<<endl;*/
    cout<<((k==0?0:w1)*(k==n-1?2:w2))%(int)(1e9+7)<<endl;
}