#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>

using namespace std;
typedef long long ll;
const int N=200010;
const ll mod=1e9+7;
struct node{
    ll a, n;

}arr[N];

bool cmp(node a, node b){
    int ai = -1, bi = -1;
    int da = a.a, db = b.a;
    while(da){
        ai ++;
        da >>= 1;
    }
    while(db){
        bi ++;
        db >>= 1;
    }
    if(ai == bi){
        return a.n < b.n;
    }
    else if(ai > bi){
        return a.n < b.n - (ai - bi);
    }
    else{
        return a.n - (bi - ai) < b.n;
    }
}

int main(){
    int n, k;
    cin >> n >> k;
    for(int i = 1; i <= n; i ++){
        scanf("%d", &arr[i]);
    }
    sort(arr + 1, arr + n + 1, cmp);

    while(k --){

        arr[1].n += 1;

        sort(arr + 1, arr + n + 1, cmp);
    }

    ll ans = 0;
    for(int i = 1; i <= n; i ++){
        int ai = arr[i].a, cnt = arr[i].n;

        int tmp = 1, t = 2;
        while(cnt){
            if(cnt & 1){
                tmp = (tmp * t) % mod;
            }
            t = t * t % mod;
            cnt >>= 1;
        }

        tmp = tmp * ai % mod;
        ans = ans + tmp % mod;
    }
    cout << ans;
    return 0;
}