#include <bits/stdc++.h>
using namespace std;
using lint = long long;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define REP(i, n) FOR(i,0,n)
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

int main()
{
    int N, V;
    cin >> N >> V;
    vector<lint> C(N);
    cin >> C;
    vector<lint> v2c(N + 1);
    REP(i, N) v2c[i + 1] = v2c[i] + C[i];

    vector<lint> dp(N * 4 + 1, 1e18);
    dp[0] = 0;
    FOR(i, 1, dp.size())
    {
        if (i < int(v2c.size()))
        {
            chmin(dp[i], v2c[i]);
        }
        REP(j, i)
        {
            chmin(dp[i], dp[j] + dp[i - j]);
        }
    }

    auto solve = [&](auto &&solve, lint v) -> vector<lint> {
        vector<lint> ret(N, 1e18);
        if (v + N - 1 < dp.size())
        {
            copy(dp.begin() + v, dp.begin() + v + N, ret.begin());
        }
        else
        {
            int head = (v - N) / 2;
            vector<lint> half = solve(solve, head);
            REP(i, N) REP(j, N)
            {
                REP(l, N * 2)
                {
                    lint k = head * 2 + i + j + l - v;
                    if (k >= 0 and k < int(ret.size())) chmin(ret[k], half[i] + half[j] + v2c[k]);
                }
            }
        }
        return ret;
    };
    cout << v2c[N] + solve(solve, V - N)[0] << '\n';
}