#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
using namespace std;

#define endl "\n"
//#define int long long

int mod=1e9+7;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int a,n,k;
	int ans=0;
	cin>>n>>k;
	priority_queue<int,vector<int>,greater<int>> q;
	for(int i=1;i<=n;i++)
	{
		cin>>a;
		q.push(a);
	}
	if(n==1)//2 4 8 16
	{
		int num=q.top();q.pop();
		while(k--)
		{
			num=(num*2)%mod;
		}
		q.push(num);
	}
	else
	{
		while(k)
		{
			int num=q.top();q.pop();
			int res=q.top();q.pop();

			while(num<=res and k)
			{
				k--;
				num=(num*2)%mod;
			}
			q.push(res);
			q.push(num);
		}
	}

	while(q.size())
	{
		ans=(ans+q.top())%mod;
		q.pop();
	}
	cout<<ans<<endl;
}