#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
using namespace std;
using Complex = complex<double>;
const int MAXN = 1e5+5;
const int N = 1e9+10;
const int mod = 1e9+7;
ll a[MAXN],col[MAXN];

void solve(){
    ll n,k;
    cin >> n >> k;
    priority_queue<int,vector<int>,greater<>> q;
    for(int i=1;i<=n;i++){
        int temp;
        cin >> temp;
        q.push(temp);
    }
    while (k){
        int temp = q.top();
        q.pop();
        q.push((temp<<1) % mod);
        k--;
    }
    ll sum = 0;
    while (!q.empty()){
        sum += q.top();
        q.pop();
        sum %= mod;
    }
    cout << sum << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}