#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef unsigned long long ull;

#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))

ull VV[102];
ull dp[1000100];

int main(){
    int N,V,C;
    cin >> N >> V;

    REP(i,N){
        cin >> C; VV[i+1] = C;
    }
    REP(i,N) VV[i+1] += VV[i];
    V = max(0, V - N);

    dp[0] = 0;
    for(int i = 1; i < 1000100; i++){
        dp[i] = dp[i-1] + VV[1];
    }
    for(int k = 2; k <= N; k++){
        for(int i = k; i < 1000100; i++){
            dp[i] = min(dp[i], dp[i-k]+VV[k]);
        }
    }
    int t = 1;
    for(int i = 2; i <= N; i++){
        if(VV[t]*i > VV[i]*t) t = i;
    }

    int k = max(0, (V-1000000) / t);
    ull cost = 0;
    cost += k * VV[t];
    cost += dp[V - k*t];
    cost += VV[N];
    cout << cost << endl;
    return 0;
}