#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define fore(i, l, r) for (register int i = (int)l; i <= (int)r; i++)
#define ford(i, r, l) for (register int i = (int)r; i >= (int)l; i--)
const int MAXN = 2123456LL;
ll T, n, k, a[MAXN];
ll ans[MAXN];
ll mod = 1e9 + 7;
priority_queue<ll, vector<ll>, greater<ll>> q;
ll qm(ll x, ll y)
{
    ll ret = 1;
    while (y)
    {
        if (y & 1)
            ret = ret * x % mod;
        x = x * x % mod;
        y >>= 1;
    }
    return ret;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll sum1 = 0;
    cin >> n >> k;
    fore(i, 1, n)
    {
        cin >> a[i];
        sum1 += a[i];
        q.push(a[i]);
    }
    sort(a + 1, a + 1 + n);
    ll cnt = 0;
    while (a[1] * 2 < a[n])
    {
        if (cnt == k)
            break;
        sum1 += a[1];
        a[1] *= 2;
        sum1 %= mod;
        cnt++;
        sort(a + 1, a + 1 + n);
    }
    if (cnt == k)
        cout << sum1 << endl;
    else
    {
        k -= cnt;
        ll tmp = k % n, zh = k / n;
        ll gg = 0;
        fore(i, 1, tmp) gg += a[i] * qm(2, zh) % mod;
        sum1 = sum1 * qm(2, zh) % mod;
        sum1 = sum1 + gg;
        sum1 %= mod;
        cout << sum1 << endl;
    }
    return 0;
}