#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#include <queue>

using namespace std;

/*
正解してたら匿名でも問題投稿ができる(実現度さらにアップ)！！！
 
warning なのにCE? 
*/

int cst[101];
int idx[101];
struct smallercost{
	bool operator()(const int &a, const int &b){
		if(cst[a]!=cst[b])return cst[a]<cst[b];
		return a<b;
	}
};
int main(){
	 
	int n,v;scanf("%d%d",&n,&v);
	unsigned long long sc=0;
	for(int i=0;i<n;i++){
		scanf("%d",&cst[i]);
		idx[i]=i;
		sc+=cst[i];
	}
	sort(idx,idx+n,smallercost());	
	
	unsigned long long csts[101]={(unsigned long long)cst[0]};
	int minidx=0;
	for(int i=1;i<n;i++)csts[i]=(unsigned long long)cst[i]+csts[i-1];
	double mincst=(double)1000000001*100,dcsts[101];
	for(int i=0;i<n;i++){
		dcsts[i]=(double)csts[i]/(i+1);	
		if(mincst>dcsts[i])mincst=dcsts[i],minidx=i;
	}
		
	v-=n;
	if(v<=0){
		printf("%llu\n",sc);return 0;
	}
	else if(idx[0]==0){
		printf("%llu\n",(unsigned long long)v*cst[0]+sc);return 0;
	}	
	
	unsigned long long minc=(unsigned long long)v*csts[0],mcs;
	for(int i=1;i<n;i++){
		if(dcsts[i]<dcsts[0]){
			mcs=v/(i+1)*csts[i];
			if(v%(i+1))mcs+=csts[v%(i+1)-1];
			if(minc>mcs)minc=mcs;
		}
	}
	
	printf("%llu\n",minc+sc);
	return 0;
}