#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;
}
struct node {
    int val, mi, mult;
    int left;
};
bool cmp1(const node x, const node y) {
    return x.val < y.val;
}
bool cmp2(const node x, const node y) {
    return log2(double(x.left)) + x.mult < log2(double(y.left)) + y.mult;
}
signed main() {
    // ios::sync_with_stdio(false);
    // cin.tie(0);
    // cout.tie(0);
    int n, k, tot = 0;
    cin >> n >> k;
    vector<node> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i].val;
        a[i].mi = log2(a[i].val);
        a[i].left = a[i].val - (1<<a[i].mi);
        // printf("val:%lld mi:%lld left:%lld\n", a[i].val, a[i].mi, a[i].left);
        tot += a[i].mi;
    }
    int ava = (tot + k) / n;
    sort(a.begin(), a.end(), cmp1);
    int m;
    for (m = n - 1; m >= 0; m--) {
        ava = (tot + k) / (m + 1);
        tot -= a[m].mi;
        if (a[m].mi < ava) break;
    }
    for (int i = 0; i <= m; i++) {
        a[i].mult = ava - a[i].mi;
        k -= a[i].mult;
    }
    sort(a.begin(), a.begin() + m + 1, cmp2);
    for (int i = 0; i <= m; i++) {
        if (k == 0) break;
        a[i].mult++;
        k--;
    }
    // puts("mult:");
    // for (int i = 0; i <= m; i++) cout << a[i].val << ' ' << a[i].mult << '\n';
    int ans = 0;
    // printf("\nnums:\n");
    for (int i = 0; i < n; i++) {
        a[i].val = a[i].val * f_pow(2, a[i].mult) % mod;
        // cout << a[i].val << ' ';
        ans = (ans + a[i].val) % mod;
    }
    // puts("");
    cout << ans % mod;
    return 0;
}