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