#include<iostream>
#include<vector>
#include<cassert>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<numeric>
using namespace std;

typedef pair<int,int> pii;
typedef long long ll;
typedef ll int__;
#define rep(i,j) for(int__ i=0;i<(int__)(j);i++)
#define repeat(i,j,k) for(int__ i=(j);i<(int__)(k);i++)
#define all(v) v.begin(),v.end()

template<typename T>
ostream& operator << (ostream &os , const vector<T> &v){
    rep(i,v.size()) os << v[i] << (i!=v.size()-1 ? " " : "\n"); return os;
}

template<typename T>
istream& operator >> (istream &is , vector<T> &v){
    rep(i,v.size()) is >> v[i]; return is;
}

#ifdef DEBUG
void debug(){ cerr << endl; }
#endif
template<class F,class...R>
void debug(const F &car,const R&... cdr){
#ifdef DEBUG
    cerr << car << " "; debug(cdr...);
#endif
}


bool solve(){
    int n, v; cin >> n >> v;
    vector<int> C(n); cin >> C;

    if( n >= v ){
        cout << accumulate(all(C), 0) << endl;
        return 0;
    }
    
    auto mini = min_element(all(C));
    ll ans = 0;
    ans += accumulate(mini+1,C.end(), 0);
    v -= C.end() - mini - 1;

    while(v > 0){
        ll num = mini - C.begin() + 1;
        ll c = v / num;
        v -= c * num;        
        ans += accumulate(C.begin(), mini+1, 0)*c;
        mini = min_element(C.begin(), mini);
    }
    cout << ans << endl;
    
    
    return false;
}

int main()
{
    ios::sync_with_stdio(false);
    while(solve());
    return 0;
}