#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int main()
{
    int n, v;
    cin >> n >> v;
    vector<long long> c(n), sum(n+1, 0);
    for(int i=0; i<n; ++i){
        cin >> c[i];
        sum[i+1] = sum[i] + c[i];
    }
    if(v <= n){
        cout << sum[n] << endl;
        return 0;
    }

    vector<long long> dp(20001, LLONG_MAX);
    dp[0] = 0;
    for(int i=0; i<20000; ++i){
        for(int j=1; j<=n; ++j){
            if(i+j <= 20000)
                dp[i+j] = min(dp[i+j], dp[i] + sum[j]);
        }
    }

    if(v <= 20000){
        long long ret = sum[n] + dp[v-n];
        cout << ret << endl;
        return 0;
    }

    int m = v - n - 15000;
    long long ret = LLONG_MAX;
    for(int i=1; i<=n; ++i){
        int a = m / i;
        int b = 15000 + m % i;
        ret = min(ret, sum[n] + sum[i] * a + dp[b]);
    }
    cout << ret << endl;

    return 0;
}