#include <bits/stdc++.h>
using namespace std ;
#define int long long
#define cer2(a,b) cerr<<#a<<'='<<(a)<<','<<#b<<'='<<(b)<<"@ line"<<__LINE__<<endl
#define cer(a) cerr<<#a<<'='<<(a)<<"@ line"<<__LINE__<<endl
#define ull unsigned long long
#define ll long long
const int N = 2e5+100, mod=1e9+7;
__int128 a[N] ,n ,m ,s1[N] ,s2[N];
__int128 b1[N],b2[N],tot;
void scan(__int128 &x){//input
	x = 0;
	int f = 1;
	char ch;
	if((ch = getchar()) == '-'){
		f = -1;
	}else{
		x = x * 10 + (ch - '0');
	}
	while((ch = getchar()) >= '0' && ch <= '9'){
		x = x * 10 + (ch - '0');
	}
	x *= f;
} 
void print(__int128 x){//output 
	if(x < 0){
		x = -x;
		putchar('-');
	}
	if(x > 9){
		print(x/10);//recursion
	}
	putchar(x%10+'0');
}
signed main(){
 	#ifndef ONLINE_JUDGE
		freopen("C:\\Users\\JIAJIEASHI\\Desktop\\in.cpp","r",stdin);
	//	freopen("out.cpp","w",stdout);
	#endif
    ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
 	scan(n);
 	scan(m);
 	__int128 m1=0, m2=0; 
 	for(int i=1;i<=n;i++) scan(a[i]) ,s1[i]=s1[i-1]+a[i],s1[i]%=mod;
 	for(int i=n;i>0;i--) s2[i] =s2[i+1] +a[i],s2[i]%=mod;
// 	cer2(m1,m2);
 	__int128 t =0 ,S=0 ;
 	
 		for(int i=1;i<=n;i++) b1[++tot] =a[i] ;
 		for(int i=1;i<=n;i++) b1[++tot] =a[i] ;
// 		cer(tot);
 		for(int i=1;i<=tot;i++) b1[i]+=b1[i-1],m1+=b1[i],m1%=mod;
	    
	    tot=0;
	    __int128 SL;
		for(int i=n;i>0;i--) b2[++tot] =a[i] ;
		for(int i=1;i<=n;i++) b2[++tot] =a[i] ;
		for(int i=1;i<=tot;i++) b2[i]+=b2[i-1],m2+=b2[i],m2%=mod;
//		cer2(m1,m2);
	    if(m1>=m2)//  ·ÅÔÚÇ°Ãæ 
	    {
	    	for(int i=1;i<=tot;i++)
	    	{
	    		S+=b1[i];
	    		S%=mod;
			}
	    	SL=b1[n]*2%mod;
		}else{//·ÅÔÚºóÃæ 
			for(int i=1;i<=tot;i++)
			{
				S+=b2[i]%mod;
			}
			SL=b2[n]*2%mod;
		};
//    cer(S);
	__int128 L = 2*n%mod ;
 	for(int i=1;i<=m-1;i++,L*=2){
        L%=mod;
 		S=2*S%mod+L*SL%mod;
 		S%=mod;
 		SL*=2;
 		SL%=mod;
	 }
	 S%=mod;
	 print(S);
 }