#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string.h>
#include<iomanip>
#include<stack>
#include<deque>
#include<queue>
#include<vector>
#include<map>
#include<set>
#define ll               long long
#define endl             "\n"
using namespace std;
inline int read() { register int s = 0, w = 1; char ch = getchar(); while (ch < '0' || ch > '9') { if (ch == '-')w = -1; ch = getchar(); }while (ch >= '0' && ch <= '9')s = s * 10 + ch - '0', ch = getchar(); return s * w; }
ll s[1000005]; ll f;
const ll mod = 1e9 + 7;
struct jh
{
	ll x, id;
	bool operator <(const jh& b)const
	{
		return x > b.x;
	}
};
int main()
{
	ll n, k;
	priority_queue<jh>d;
	cin >> n >> k; ll g, maxn = 0;
	for (int i = 1; i <= n; i++)
	{
		cin >> s[i];
		d.push({ s[i],(ll)i });
		if (s[i] > maxn)maxn = s[i];

	}
	while (k)
	{
		if (d.top().x != maxn)
		{
			ll p = d.top().x, l = d.top().id;
			d.pop();
			d.push({ p * 2%mod,l });
			k--;
		}
		else break;
	}
	ll m = 1;
	while (k - n >= 0)
	{
		k -= n;
		m = (m * 2) % mod;
	}
	while (n--)
	{
		ll p = d.top().x*m%mod, l = d.top().id;
		d.pop();
		d.push({ p,l });
	}
	while (k--)
	{
		ll p = d.top().x * 2 % mod, l = d.top().id;
		d.pop();
		d.push({ p,l });
	}
	ll sum = 0;
	while (!d.empty())
	{
		sum = (sum+d.top().x)%mod;
		d.pop();
	}
	cout << sum;
	return 0;
}