#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define endl '\n'
#define all(a) a.begin(), a.end()
#define x first
#define y second
#define rep(i, l, r) for (int i = l; i <= r; i++)
#define debug(_x) cout << #_x << '=' << _x << endl
typedef pair<int, int> PII;
const double eps = 1e-8;
const double pi = acos(-1);
const int mod = 1e9 + 7;
const int N = 2e5 + 10;

ll n, k;
ll a[N];

int qsm(int a, int k, int mod)
{
    int res = 1;
    while (k)
    {
        if (k & 1)
            res = res * a % mod;
        k >>= 1;
        a = (ll)a * a % mod;
    }
    return res;
}

void solve()
{
    ll mx = 0;
    cin >> n >> k;
    priority_queue<ll, vector<ll>, greater<ll>> q;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        q.push(a[i]);
        mx = max(mx, a[i]);
    }
    while (k)
    {
        int x = q.top();
        q.pop();
        while (k && x <= q.top())
            x *= 2, k--;
        q.push(x);
        if (q.top() >= mx)
        {
            while (k % n != 0)
            {
                k--;
                int x = q.top();
                q.pop();
                q.push(x * 2);
            }
            ll sum = 0;
            while (!q.empty())
            {
                sum += q.top();
                q.pop();
                sum %= mod;
            }
            cout << qsm(2ll, (k) / n, mod) * sum % mod << endl;
            return;
        }
    }
    ll sum = 0;
    while (!q.empty())
    {
        sum += q.top();
        q.pop();
        sum %= mod;
    }
    cout << sum << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int _ = 1;
    // cin >> _;

    while (_--)
        solve();

    return 0;
}