#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
bool chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
bool chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") {
    cout << (f ? yes : no) << "\n";
}

void solve() {
    ll n, v;
    cin >> n >> v;
    vl c(n);
    rep(i, n) cin >> c[i];
    ll sum = accumulate(all(c), 0LL);
    if (v <= n) {
        cout << sum << '\n';
        return;
    }
    // v > n
    v -= n;
    vl cum(n + 1);
    rep(i, n) cum[i + 1] = cum[i] + c[i];
    int id = 1;
    REP(i, 1, n + 1) {
        if (cum[i] * id < cum[id] * i) {
            id = i;
        }
    }
    const int ma = 2e6;
    const ll inf = 1e18;
    vector<ll> dp(ma, inf);
    dp[0] = 0;
    REP(i, 1, n + 1) {
        for (int j = 0; i + j < ma; ++j) {
            chmin(dp[i + j], dp[j] + cum[i]);
        }
    }
    ll ans = sum, res = v;
    if (v >= ma - 1) {
        ll k = (v - ma) / id;
        res -= k * id;
        ans += k * cum[id];
    }
    ans += dp[res];
    cout << ans << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}