#include<bits/stdc++.h>
// #define int long long
#define int __int128

using namespace std;
using i64=long long;
const int M1=998244353;
const int M2=1000000007;
const int M3=1610612741;
using ll=long long;
using PII=pair<int,int>;

namespace __Kei128{ 
    using i128=__int128;
    i128 abs(const i128 &x){
        return x>0?x:-x;
    }
    auto &operator>>(istream &it,i128 &j){
        string val;
        it>>val;
        reverse(val.begin(), val.end());
        i64 ans=0;
        bool f=0;
        char c=val.back();
        val.pop_back();
        for(;c<'0'||c>'9';c=val.back(),val.pop_back()){
            if(c=='-'){
                f=1;
            }
        }
        for(;c>='0'&&c<='9';c=val.back(),val.pop_back()){
            ans=ans*10+c-'0';
        }
        j=f?-ans:ans;
        return it;
    }
    auto &operator<<(ostream &os, const i128 &j) {
        string ans;
        function<void(i128)>write=[&](i128 x) {
            if(x<0)ans+='-',x=-x;
            if(x>9)write(x/10);
            ans+=x%10+'0';
        };
        write(j);
        return os<<ans;
    }
}using namespace __Kei128;


const int N=2e5+10;
const int mod=1e9+7;

int a[N];

void kei(){
    int n,k;
    cin>>n>>k;
    map<int,int>f;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        f[a[i]]++;
    }

    int res=0;
    while(k>0){
        auto [u,v]=*f.begin();
        // for(auto [i,j]:f)cout<<i<<' '<<j<<endl;cout<<endl;
        f.erase(f.begin());
        if(v<k){
            f[u*2]=v;
            k-=v;
        }
        else{
            for(auto [x,y]:f)res=(res+x*y%mod)%mod;
            res=(res+k*2%mod*u%mod+(v-k)*u%mod)%mod;
            break;
        }
    }
    cout<<res<<'\n';
}   

signed main(){
    // srand(time(0));
    cin.tie(nullptr)->ios::sync_with_stdio(false);
    int tt=1;
    // cin>>tt;
    while(tt--)kei();
}