//#include <bits/stdc++.h>
#include <assert.h>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <iterator>
#include <unistd.h>

using namespace std;

typedef signed long long ll;

#define pp(...) (void)printf(__VA_ARGS__)
#define For(x,to) for(x=0;x<(to);x++)
#define ForAuto(x,arr) for(auto& x:arr)
#define ForBeginEnd(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define All(a) (a.begin()),(a.end())
#define Zeros(a) memset(a,0,sizeof(a))
#define Minus(a) memset(a,0xff,sizeof(a))

#define PI 3.14159265
#define EPS (1e-10)
#define EPS_eq(a,b) (abs((a)-(b)) < EPS)

#pragma GCC diagnostic ignored "-Wconversion"

//#define int long long
#define INF 1000*1000

int dxy[] = {0, 1, 0, -1, 0};

typedef pair<int, int> P;

void pp_int(int x){ printf("%d\n", x); };

int i,j,k;

ll M = 100000009;

//ios::sync_with_stdio(false);

//-------------------------------------------------


ll n, v;
ll c[105];
ll s[105];

// i本目まで使った時のjリットル買う最小値
ll dp[105][105];

int min_i;

signed main() {
    cin>>n>>v;
    for(int i=0;i<n;i++){
        cin>>c[i];
        if(i>=1)s[i] = s[i-1];
        s[i] += c[i];
    }
    min_i = 0;
    for(int i=1;i<n;i++){
        double unit1 = s[min_i] / (min_i+1.0);
        double unit2 = s[i] / (i+1.0);
        if(unit1>unit2)
            min_i = i;
    }
    ll cost = s[n-1];
    if(v<=n){
        cout<<cost<<endl;
        return 0;
    }
    v-=n;
    int left = v % (min_i + 1);
    cout<<"left:"<<left<<endl;
    cost += (v / (min_i + 1)) * s[min_i];
    cout<<"cost:"<<cost<<endl;
    if(left == 0){
        cout<<cost<<endl;
        return 0;
    }

    ll mn = s[min_i];
    for(int i = 0; i < 105; i++)
        fill(dp[i], dp[i]+105, 1ll<<55);
    for(int i=0;i<n;i++){
        int needs = i + 1;
        dp[i][0] = 0;
        for(int j = 0; j <= left; j++){
            dp[i + 1][j] = min(dp[i + 1][j], dp[i][j]);

            if(j-needs>=0){
                dp[i + 1][j] = min(dp[i + 1][j], dp[i][j-needs] + s[i]);
                dp[i + 1][j] = min(dp[i + 1][j], dp[i+1][j-needs] + s[i]);
            }
        }
    }

    for(int i=left;i<105;i++){
        if(mn>dp[n][i])mn = dp[n][i];
    }

    cout<<cost+mn<<endl;

    return 0;
}