#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll MOD = 1e9 + 7;

ll hatvany(ll a){
    ll vissza = 1;
    ll akt = 2;

    for(ll i = 0; i < 31; i++){
        if(a & (1 << i)){
            vissza *= akt;
            vissza %= MOD;
        }

        akt *= akt;
        akt %= MOD;
    }

    return vissza;
}

int main()
{
    ll n, k;
    cin >> n >> k;
    k--;

    vector<ll> alap(n);
    for(ll &x : alap) cin >> x;

    vector<int> pref(n + 1);
    for(int i = 1; i <= n; i++){
        pref[i] = pref[i - 1] + alap[i - 1];
    }

    vector<int> dp(n);
    dp[0] = 2;
    for(int i = 1; i < k; i++){
        int bal = pref[i + 1];
        int jobb = pref[k + 1] - pref[i + 1];

        dp[i] = dp[i - 1];

        if(bal <= jobb){
            dp[i] *= 2;
        }

        dp[i] %= MOD;
    }


    for(int i = n - 1; i > k; i--){
        int l = i + 1, r = n - 1;
        int ind = -1;
        while(l <= r){
            int mid = (l + r) / 2;

            int bal = pref[i];
            int jobb = pref[mid + 1] - pref[i];

            if(bal > jobb){
                ind = mid;
                l = mid + 1;
            } else{
                r = mid - 1;
            }
        }

        dp[i] = (i == n - 1 ? 2 : dp[i + 1]) + (ind == -1 ? 0 : dp[ind]);
        dp[i] %= MOD;
    }

    cout << (k == 0 ? 0 : dp[k - 1]) * (k == n - 1 ? 2 : dp[k + 1]) << "\n";
}