#include <bits/stdc++.h>
#define NOSYNC ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define all(x) x.begin(), x.end()
#define endl '\n'
#define int ll
using namespace std;
using ll = long long;
using ull = unsigned long long;

const int N = 200005;
const int MOD = 1e9+7;

// -------------- Templates Above -------------------------

int qpow(int a, int b) {
	int res = 1;
	while(b) {
		if(b & 1) res = res * a % MOD;
		a = a * a % MOD;
		b >>= 1;
	}
	return res;
}

void solve() {
	int n, k; cin >> n >> k;
	vector<int> a(n);
	vector<int> b(n); vector<int> c(n, 0);
	for(int i = 0; i < n; i ++) cin >> a[i];
	sort(all(a));
	int mx = 0;
	for(int i = 0; i < n; i ++) {
		b[i] = log2(a[i]);
		mx = max(mx, b[i]);
	}
	for(int i = 0; i < n; i ++) {
		int d = mx - b[i];
		if(k >= d) {
			k -= d;
			c[i] += d;
		}
		else {
			c[i] += k;
			k = 0;
		}
	}
	int q = k / n; int r = k % n;
	for(int i = 0; i < r; i ++) {
		c[i] += q + 1;
	}
	for(int i = r; i < n; i ++) {
		c[i] += q;
	}
	int ans = 0;
	for(int i = 0; i < n; i ++) {
		int now = qpow(2, c[i]);
		now = now * a[i] % MOD;
		ans = (ans + now) % MOD;
	}
	
	cout << ans << endl;
	
}

signed main() {
	NOSYNC;
	solve();
	return 0;
}