#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 10;
const int mod = 1e9 + 7;

int qpow(int a, int p) {
    a %= mod;
    int res = 1;
    for (; p > 0; p >>= 1, a = a * a % mod) {
        if (p & 1) res = res * a % mod;
    }
    return res;
}

int a[N];

signed main() {
    int n, k;
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    sort(a + 1, a + 1 + n);

    for (int i = 1; i <= 40; i++) {
        int last = 1;
        for (int j = 2; j <= n; j++) {
            if (a[1] * 2 <= a[j]) {
                last = j;
                break;
            }
        }
        for (int j = 1; j < last; j++) {
            while (k > 0 && a[j] * 2 <= a[last]) {
                a[j] *= 2;
                k--;
            }
        }
    }
    int tmp = k / n;
    for (int i = 1; i <= k % n; i++) {
        a[i] *= 2;
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) {
        ans = (ans + a[i]) % mod;
    }
    cout << (ans % mod * qpow(2, tmp) % mod) % mod << endl;
}