#include<cstdio>
#include<set>
using namespace std;
typedef long long LL;
const int MOD=1e9+7;
int read() {
	int x=0; char ch=getchar();
	while(ch<'0'||ch>'9') ch=getchar();
	while('0'<=ch&&ch<='9') x=10*x+ch-'0', ch=getchar();
	return x;
}
LL Pow(LL x,int p) {
	if(p==0) return 1ll;
	if(!(p&1)) return Pow(x*x%MOD,p>>1);
	return x*Pow(x*x%MOD,p>>1)%MOD;
}
int n,k;
multiset<LL>num;
int main() {
	n=read(), k=read();
	for(int i=1;i<=n;i++)
		num.insert(read());
	while(k) {
		int Mn=*num.begin(), Mx=*(--num.end());
		if(Mn*2>Mx) break;
		num.erase(num.begin());
		num.insert(2*Mn);
		k--;
	}
	LL sum=0;
	for(auto i:num)
		sum+=i;
	if(k) {
		int l=k%n, r=n-l;
		LL suml=0, sumr=0;
		auto iter=num.begin();
		while(l) suml+=*iter, l--;
		while(r) sumr+=*iter, r--;
		LL ans=Pow(suml%MOD,k/n+1)+Pow(sumr%MOD,k/n);
		printf("%lld\n",ans%MOD);
	}
	else {
		printf("%lld\n",sum%MOD);
	}
	return 0;
}