#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, mi, i;

}arr[N];

bool cmp(node a, node b){
    return a.a < b.a;
}

struct cmpmi
{
    //重载 () 运算符
    bool operator()(node a, node b)
    {
        int ai = -1, bi = -1;
        int da = a.a, db = b.a;
        while(da){
            ai ++;
            da = da & (da - 1);
        }
        while(db){
            bi ++;
            db = db & (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;

    priority_queue<node, vector<node>, cmpmi> que;
    for(int i = 1; i <= n; i ++){
        scanf("%lld", &arr[i].a);
    }

    // 真值排序
    sort(arr + 1, arr + n + 1, cmp);

    // 计算最大值的二进制位数
    int maxx = arr[n].a, maxi = -1;
    while(maxx){
        maxi ++;
        maxx >>= 1;
    }
    // 底数真值，指数，方向指数，下标
    que.push({arr[n].a, 0, 0, n});

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

        while((1 << maxi) > tmp){
            cnt ++;
            tmp <<= 1;
            //cout << "?";
        }
        arr[i].mi = cnt;
        // que.push({arr[i].a, arr[i].n, arr[i].mi, i});
        que.push({arr[i].a, 0, arr[i].mi, i});

    }
    // for(int i = 1; i <= n; i ++){
    //     cout << arr[i].mi << " ";
    // }cout << endl;
    int f = 0;
    while(k){
        auto toop = que.top();
        //cout << toop.a << " ";
        if(toop.mi == 0){
            f = 1;
            break;
        }
        
        que.pop();
        k --;
        toop.mi -= 1;
        toop.n += 1;
        arr[toop.i].n += 1;
        que.push(toop);
        
    }
    //k = k + 1;
    //cout << k << endl;
    if(k){
        int tk = k / n;
        k = k % n;
        for(int i = 1; i <= n; i ++){
            arr[i].n += tk;
            if(i <= k)arr[i].n += 1;
        }
    }

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

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

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

/*
3 10 7 2 1
28 32 16


3 100 1 1 1

8 8 16
*/