#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
   int s=0,w=1;
   char ch=getchar();
   while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
   while(ch>='0'&&ch<='9')s=s*10+ch-'0',ch=getchar();
   return s*w;
}
inline void out(int x){
    if(x==0){putchar('0');return;}
	int len=0,k1=x,c[10005];
	if(k1<0)k1=-k1,putchar('-');
	while(k1)c[len++]=k1%10+'0',k1/=10;
	while(len--)putchar(c[len]);
}
const int N=2e5+5,V=31,mod=1e9+7;
int h_bit(int x){
	int k=0;
	while(x>0)k++,x>>=1;
	return k;
}
int qpow(int a,int b){
	int ans=1;
	while(b){
		if(b&1)ans=(ans*a)%mod;
		b>>=1,a=(a*a)%mod;
	}
	return ans;
}
vector<int>v[V]; 
signed main(){
	int n=read(),k=read();
	for(int i=1;i<=n;i++){
		int x=read();
		v[h_bit(x)].push_back(x);
	}
	for(int i=0;i<V;i++){
		sort(v[i].begin(),v[i].end());
		if(v[i].size()==n){
			int sum=0,d=k/n,r=k%n;
			for(int j=0;j<r;j++)sum+=(v[i][j]*qpow(2,d+1))%mod;
			for(int j=r;j<n;j++)sum+=(v[i][j]*qpow(2,d))%mod;
			cout<<sum%mod;return 0;
		}
		for(auto x:v[i]){
			if(k==0){
				int sum=0;
                for(int j=0;j<V;j++){
                	for(auto x:v[j])sum=(sum+x)%mod;
				}
				cout<<sum%mod;return 0;
			}
			k--;v[i+1].push_back(x<<1);
		}
		v[i].clear();
	}
    return 0;
}