#include<cstdio>
#include<iostream>
#include<vector>
#include<algorithm>
#define RI register int
#define CI const int&
using namespace std;
const int N=200005,mod=1e9+7;
int n,k; vector <int> vec[30];
inline int quick_pow(int x,int p=mod-2,int mul=1)
{
    for (;p;p>>=1,x=1LL*x*x%mod) if (p&1) mul=1LL*mul*x%mod; return mul;
}
int main()
{
    scanf("%d%d",&n,&k);
    for (RI i=1;i<=n;++i)
    {
        int x; scanf("%d",&x);
        vec[32-__builtin_clz(x)].push_back(x);
    }
    for (RI i=0;i<30;++i)
    {
        sort(vec[i].begin(),vec[i].end());
        if ((int)vec[i].size()==n)
        {
            int d=k/n,r=k%n,sum=0;
            for (RI j=0;j<r;++j)
            (sum+=1LL*vec[i][j]%mod*quick_pow(2,d+1)%mod)%=mod;
            for (RI j=r;j<n;++j)
            (sum+=1LL*vec[i][j]%mod*quick_pow(2,d)%mod)%=mod;
            return printf("%d",sum),0;
        }
        for (auto &x:vec[i])
        {
            if (k==0)
            {
                int sum=0;
                for (RI j=0;j<30;++j)
                for (auto x:vec[j]) (sum+=x%mod)%=mod;
                return printf("%d",sum),0;
            }
            --k; vec[i+1].push_back(x<<1); x=0;
        }
        vec[i].clear();
    }
    return 0;
}