# O(N)

from sys import stdin
input=stdin.readline

mod=10**9+7

def solv():
    N,K = [int(x) for x in input().split()]
    W = [int(x) for x in input().split()]
    if N==1:
        print(2)
        return
    if K==1:
        print(0)
        return
    preW=[0]*N
    for i in range(N):
        preW[i]=preW[i-1]+W[i]
    i=K-2
    while preW[i]*2 > preW[K-1]:
        i-=1
    # 2^(i+1) lehetoseg balra
    if K==N:
        print(pow(2,i+2,mod))
        return
    # K<N:
    d={}
    j=K
    while j<N and 2*preW[K-1] > preW[j]:
        j+=1
    if j==N:
        print(pow(2,i+1+N-K,mod))
        return
    if K==j:
        print(0)
        return
    d={K-1:j}
    for k in range(K,N):
        while j<N and 2*preW[k] > preW[j]:
            j+=1
        if j==N:
            break
        if k+1==j:
            print(0)
            return
        d[k]=j
    DP=[0]*N
    sufDP=[0]*(N+1)
    for k in range(N-2,K-2,-1):
        if k not in d:
            DP[k]=pow(2,N-k-1,mod)
            sufDP[k]=(sufDP[k+1]+DP[k])%mod
        else:
            DP[k]=(sufDP[k+1]-sufDP[d[k]])%mod
            sufDP[k]=(sufDP[k+1]+DP[k])%mod
    print((pow(2,i+1,mod)*DP[K-1])%mod)
    
solv()