#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=2e5+5,p=1e9+7;
ll qpow(ll x,ll y){
	ll s=1;
	while(y){
		if(y&1)s=s*x%p;
		x=x*x%p;
		y>>=1;
	}
	return s;
}
ll a[maxn];
void solve(){
	int n,k;
	cin>>n>>k;
	priority_queue<ll,vector<ll>,greater<ll>>q;
	int t=0;
	for(int i=1;i<=n;i++){
		int x;
		cin>>x;
		q.push(x);
		t=max(t,x);
	}
	while(k>0&&(k%n||q.top()*2<t)){
		k--;
		ll now=q.top();
		q.pop();
		q.push(now*2);
	}
	ll tmp=qpow(2,k/n);
	ll ans=0;
	for(int i=1;i<=n;i++){
		ll x=q.top();
		q.pop();
		ans+=x%p*tmp%p;
		if(ans>=p)ans-=p;
	}
	cout<<ans<<"\n";
}
int main(){
	ios::sync_with_stdio(0),cin.tie(0);
	int t=1;
	// cin>>t;
	while(t--)solve();
	return 0;
}