#include<bits/stdc++.h>
using namespace std;

const int mod = 1e9 + 7;

int main() {
    int n, k;
    cin >> n >> k;
    priority_queue<int, vector<int>, greater<int>> q;
    for(int i = 1; i <= n; ++i) {
        int x;
        cin >> x;
        q.push(x);
    }
    while(k--) {
        int x = q.top(); q.pop();
        q.push((x * 2) % mod);
    }
    int ans = 0;
    while(q.size()) {
        ans = (ans + q.top()) % mod;
        q.pop();
    }
    cout << ans;
}