#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
ll C[102],S[102];
ll co[20900];
void solve(){
    ll N,V; cin>>N>>V;
    for(int i=0;i<N;++i){
        cin>>C[i+1];
        S[i+1]=S[i]+C[i+1];
    }

    if(V<=N){
        cout<<S[N];
        return;
    }

    V-=N;
    int x=1;
    for(int i=2;i<=N;++i){
        if(S[i]*x<S[x]*i)x=i;
    }

    for(int i=0;i<=min(20200ll,V);++i){
        co[i]=1ll<<60;
        if((V-i)%x==0){
            co[i]=(V-i)/x*S[x];
        }
    }

    for(int i=min(20000ll,V);i>=0;--i){
        for(int j=1;j<=N;++j){
            co[i]=min(co[i],co[i+j]+S[j]);
        }
    }
    cout<<co[0]+S[N];
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int T=1; // cin>>T;
    while(T--)solve();
    cout<<endl;
    return 0;
}