#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 50;
const int mod1 = 1e9 + 7;
typedef long long ll;
int a[N];
int ans = 0;
set<int> s;
int qsm(int x, int k)
{
    int ans = 1;
    while (k)
    {
        if (k & 1)
            ans *= x;
        x *= x;
        k /= 2;
        x %= mod1;
        ans %= mod1;
    }
    return ans;
}
void solve()
{
    vector<int> v;
    int n, k;
    cin >> n >> k;
    for (int i = 1; i <= n; i++)
        cin >> a[i], s.emplace(a[i]);
    if (k > 32 * n)
    {
        while (k-- && !s.empty())
        {
            int x = *s.begin();
            if (x * 2 > 1e9)
            {
                s.erase(x);
                v.push_back(x);
            }
            else
            {
                s.emplace(x * 2);
                s.erase(x);
            }
        }
        sort(v.begin(), v.end());
        for (int i = 0; i < k % n; i++)
        {
            v[i] *= 2;
        }
        k = k / n * n;
        for (int i = 0; i < k % n; i++)
        {
            v[i] = v[i] % mod1 * qsm(2, k / n)%mod1;
        }
        for (auto ff : v)
        {
            ans += ff;
            ans %= mod1;
        }
    }
    else
    {
        while (k--)
        {
            int x = *s.begin();
            s.emplace(x * 2);
            s.erase(x);
        }
        for (auto ff : s)
        {
            ans += ff;
            ans %= mod1;
        }
    }
    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}