#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N];
const int p1 = 1e9 + 7;
int main()
{
	int n , k;
	long long ans = 0;
	cin >> n >> k;
	priority_queue<long long, vector<long long> , greater<long long>> q;
	for(int i = 1 ; i <= n ; ++ i)
	{
		cin >> a[i];	
		q.push(a[i]);
	}	
	while(k --)
	{
		int p = q.top();
		q.pop();
		p *= 2;
		p %= p1;
		q.push(p);
	}
	while(!q.empty())
	{
		ans += q.top();
		ans %= p1;
		q.pop();
	}
	cout << ans ;
}