#include <bits/stdc++.h>
#define int long long
#define pii pair<int, int>
using namespace std;
const int mod = 1e9 + 7;
int f_pow(int x, int y) {
    if (y == 1) return x;
    if (y == 0) return 1;
    int t = f_pow(x, y / 2) % mod;
    if (y % 2)
        return t * t % mod * x % mod;
    else
        return t * t % mod;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n, k, m = 0, tot = 0;
    cin >> n >> k;
    vector<pii> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i].first;
        a[i].second = log2(a[i].first);
        if (a[i].second <= (k + n - 1) / n) tot += a[i].second, m++;
    }
    vector<int> mult(n);  // 储存这里即将乘2的多少次方
    int ava = (tot + k) / m;
    sort(a.begin(), a.end());
    for (int i = 0; i < n; i++) {
        if (a[i].second > ava) break;
        mult[i] = ava - a[i].second;
        k -= a[i].second;
    }
    int ans = 0;
    for (int i = 0; i < n; i++) {
        a[i].first = a[i].first * f_pow(2, mult[i]) % mod;
        if (k) a[i].first = a[i].first * 2 % mod,k--;
        // cout<< a[i].first << ' ';
        ans = (ans + a[i].first) % mod;
    }
    cout << ans;
    return 0;
}