#include<bits/stdc++.h>
#define mod 1000000007
using namespace std;
int n,k,a[200005],f[200005];
int pw(int a,int b){
    int res=1;
    while(b){
        if(b&1) res=1ll*res*a%mod;
        a=1ll*a*a%mod,b>>=1;
    }
    return res;
}
void sol(){
    cin>>n>>k;
    for(int i=1;i<=n;++i) cin>>a[i];
    sort(a+1,a+1+n);
    for(int i=1;i<=n;++i){
        int v=a[i],ct=0;
        if(i!=n){
            while(v*2<=a[i+1]) v<<=1,++ct;
        }else   
            ct=1;
        // cerr<<k<<" "<<ct<<" "<<i<<endl;
        if(k>=ct*i&&i!=n){
            k-=ct*i;
            f[i]+=ct;
        }else{
            f[i]+=k/i;
            ++f[k%i];
            k=0;
        }
    }
    for(int i=n-1;i>=1;--i) f[i]+=f[i+1];
    // for(int i=1;i<=n;++i) cerr<<f[i]<<" \n"[i==n];
    int ans=0;
    for(int i=1;i<=n;++i){
        ans=(0ll+ans+1ll*a[i]*pw(2,f[i]))%mod;
    }
    cout<<ans<<'\n';
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    sol();
    return 0;
}