#include<bits/stdc++.h>
using namespace std;
const int N = 2e5+5,M=1e9+7;
typedef long long LL;
int n,k;
LL t;
priority_queue<LL> q;
int main(){
	scanf("%d %d",&n,&k);
	for(int i=1;i<=n;i++) {
		scanf("%lld",&t);
		q.push(t);
	}
	while(k--){
		t = q.top();
		q.pop();
		q.push(t<<1);
	}
	LL res=0;
	while(q.size()){
		res +=q.top()%M;
		res %=M;
		q.pop();
	}
	printf("%lld",res);
	return 0;
}