#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;

int main()
{
    int n; ll v; cin>>n>>v;
    v-=n;
    ll c[101], s[101];
    s[0]=0;
    int ind[101];
    for(int i=1; i<=n; i++){
        cin>>c[i];
        s[i]=s[i-1]+c[i];
        ind[i]=i;
    }
    if(v<=0){
        cout<<s[n]<<endl;
        return 0;
    }
    sort(ind+1, ind+n+1, [&](int i, int j){ return s[i]*(ll)j<s[j]*(ll)i;});
    int m=ind[1];
    ll dp[10001];
    fill(dp, dp+1+n*n, 1e18);
    dp[0]=0;
    for(int i=1; i<=n; i++){
        for(int j=0; j<=n*n-i; j++){
            dp[j+i]=min(dp[j+i], dp[j]+s[i]);
        }
    }
    ll ans=1e18;
    for(int j=0; j<=n*n; j++){
        if(v<=j) ans=min(ans, dp[j]);
        else ans=min(ans, dp[j]+(v-(ll)j+(ll)m-1)/(ll)m*s[m]);
    }
    cout<<ans+s[n]<<endl;
    return 0;
}