#include<bits/stdc++.h>
using namespace std;
const int N=200005,mod=1000000007;
int n,k,tot,res,a[N],b[N];
priority_queue<int,vector<int>,greater<int>> pq;
int fastpow(int a,int x){
	int res=1;
	while(x){
		if(x&1){
			res=1LL*res*a%mod;
		}
		x>>=1;
		a=1LL*a*a%mod;
	}
	return res;
}
int main(){
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
	}
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++){
		b[i]=a[i];
		while(b[i]*2LL<a[n]){
			b[i]*=2;
			tot++;
		}
	}
	if(k<tot){
		for(int i=1;i<=n;i++){
			pq.push(a[i]);
		}
		while(k--){
			int x=pq.top();
			pq.pop();
			pq.push(x*2);
		}
		for(int i=1;i<=n;i++){
			res=(res+pq.top())%mod;
			pq.pop();
		}
	}else{
		k-=tot;
		int t=k/n,y=k%n,pw=fastpow(2,t);
		for(int i=1;i<=n;i++){
			b[i]=1LL*b[i]*pw%mod;
			if(i<=y){
				b[i]=(b[i]+b[i])%mod;
			}
			res=(res+b[i])%mod;
		}
	}
	printf("%d\n",res);
	return 0;
}