#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <math.h>
#define  int long long 
#define MAX 200005
const int mod = 1e9 + 7;
const int MX = 1e11;
using namespace std;

int n, k, a[MAX];
int to2[MAX];
priority_queue<int, vector<int>, greater<int>> q;
int ans;

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

signed main()
{
    ios::sync_with_stdio(0);cin.tie(0);
    cin >> n >> k;
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
        q.push(a[i]);
    }
    q.push(MX);
    int t = q.top();
    do{
        q.pop();
        q.push((t * 2) % mod);
        k--;
        t = q.top();
    }while (t != MX && k);
    if (t == MX)
        q.pop();
    for (int i = 0; i < n; i++)
    {
        int t = q.top();
        a[i] = t;
        q.pop();
    }
    for (int i = 1; i <= n; i++)
    {
        if (i <= k % n)
        {
            a[i - 1] = (a[i - 1] * 2 * (k / n + 1));
        }
        else
        {
            if ((k / n) == 0)
                continue;
            a[i - 1] = (a[i - 1] * 2 * (k / n)) ;
        }
    }
    for (int i = 0; i < n; i++)
        ans += a[i], ans %= mod;
    cout << ans << endl;
    return 0;
}