#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const long long MOD = 1e9 + 7;

int main() {
    int n;
    long long k;
    cin >> n >> k;
    vector<long long> a(n);
    
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    sort(a.begin(), a.end());
    
  
    long long totalSum = 0;
    for (int i = 0; i < n; ++i) {
        totalSum += a[i];
    }
    
  
    for (int i = 0; i < n && k > 0; ++i) {
      
        long long nextVal = (i < n - 1) ? a[i + 1] : a[i] * 2;
        long long numOps = min(k, (nextVal - a[i]) / a[i] * (i + 1));
        
     
        if (numOps > 0) {
            totalSum += a[i] * numOps;
            k -= numOps;
            for (int j = 0; j <= i; ++j) {
                a[j] *= 2;
            }
        }
    }
    
 
    if (k > 0) {
        sort(a.begin(), a.end());
        a[0] *= (1LL << (k / n));
        for (int i = 0; i < k % n; ++i) {
            a[i] *= 2;
        }
    }

    long long result = 0;
    for (int i = 0; i < n; ++i) {
        result = (result + a[i]) % MOD;
    }
    
    cout << result << endl;

    return 0;
}