#include <bits/stdc++.h>
using namespace std;
#define maxn 200005
#define mod 1000000007
int n, k, x, tot;
#define ll long long
vector<ll> a[50];
ll fp(ll x)
{
    ll ans = 1, y = 2;
    while (x) {
        if (x & 1) {
            x--;
            ans *= y;
            ans %= mod;
        }
        else {
            y *= y;
            y %= mod;
            x >>= 1;
        }
    }
    return ans;
}
void solve()
{
    ll ans = 0;
    int i;
    for (i = 0; i < tot && k; i++) {
        if (k >= a[i].size()) {
            k -= a[i].size();
            for (int j = 0; j < a[i].size(); j++) {
                a[i + 1].push_back(a[i][j] << 1);
            }
        }
        else {
            sort(a[i].begin(), a[i].end());
            for (int j = 0; j < k; j++) {
                ans += (a[i][j] << 1);
            }
            for (int j = k; j < a[i].size(); j++) {
                ans += a[i][j];
            }
            k = 0;
        }
    }
    if (k == 0)
        for (; i <= tot; i++) {
            for (int j = 0; j < a[i].size(); j++) {
                ans += a[i][j];
            }
        }
    else {
        sort(a[tot].begin(), a[tot].end());
        ll x = k / a[tot].size(), y = k % a[tot].size();
        for (int i = 0; i < y; i++) {
            a[tot][i] = a[tot][i] << 1;
            a[tot][i] %= mod;
        }
        for (int i = 0; i < a[tot].size(); i++) {
            ans += (a[tot][i] * fp(x)) % mod;
            ans %= mod;
        }
    }
    cout << ans << endl;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> x;
        for (int i = 30; i >= 0; i--) {
            if ((x >> i) & 1) {
                tot = max(i, tot);
                a[i].push_back(x);
                break;
            }
        }
    }
    solve();
}