#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    int N, V, C[101];
    ll cost = 0;
    cin >> N >> V;
    for (int i = 0; i < N; i++) {
        cin >> C[i];
        cost += C[i];
    }

    V -= N;
    V = max(0, V);

    ll sum[110] = {};
    ll best = 1;
    for (int i = 0; i < N; i++) {
        sum[i + 1] = sum[i] + C[i];
        if (sum[i + 1] * best < sum[best] * (i + 1))
            best = i + 1;
    }


    ll dp[30010] = {};
    for (int i = 1; i < 25000; i++) {
        dp[i] = dp[i - 1] + sum[1];
    }
    for (int i = 1; i <= N; i++) {
        for (int v = 0; v < 20000; v++) {
            dp[v + i] = min(dp[v + i], dp[v] + sum[i]);
        }
    }

    ll times = max((V - 15000) / best, 0ll);
    cost += times * sum[best] + dp[V - times * best];

    cout << cost << endl;
}