#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+5,mods=1e9+7;
int p[N],n,k;
double g[N];
struct node{
	int bh;double sm;
	friend bool operator<(node a,node b){
		return a.sm>b.sm;
	}
};
priority_queue<node>q;
int pows(int a,int b){
	if(b==0)return 1;
	int res=pows(a,b>>1);
	res=res*res%mods;
	if(b&1)res=res*a%mods;
	return res;
}
signed main(){
	cin>>n>>k;
	int res=0;
	for(int i=1;i<=n;i++)cin>>p[i],g[i]=log2(p[i]),q.push({i,g[i]}),res+=p[i];
	int cnt=0;
	while(k--){
		cnt++;
		if(cnt>1000000){
			int t=k/n;
			k-=t*n;
			for(int i=1;i<=n;i++)res+=(pows(2,t)-1)*p[i],res%=mods,p[i]=p[i]*pows(2,t)%mods;
		    cnt=-1e18;
		}
		int x=q.top().bh;
		q.pop();
		g[x]+=1;
		q.push({x,g[x]});
		res+=p[x];
		p[x]=p[x]*2%mods;
		res%=mods;
	}
	cout<<res;
}