#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef pair<int, int> P;
typedef unsigned int uint;
typedef unsigned long long ull;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};

const ll inf = 1000000009;
const double eps = 1e-8;

ll solve(int n, ll v) {
    ll cs[n];
    ll sum[n];
    double ave[n];
    double mini = inf * inf;
    int idx;
    ll res = 0;
    for (int i = 0; i < n; i++) {
	ll c;
	scanf("%lld", &c);
	cs[i] = c;
	res += c;
	sum[i] = (i == 0 ? c : sum[i-1] + c);
	ave[i] = (double)sum[i] / (i+1);
	if (ave[i] < mini) {
	    mini = ave[i];
	    idx = i;
	}
    }
    v -= n;
    if (v <= 0) {
	return res;
    } else {
	if (v >= 10000) {
	    ll d = v - 10000;
	    d /= (idx+1);
	    res += sum[idx] * d;
	    v -= d * (idx+1);
	}
	ll dp[v+1];
	fill_n(dp, v+1, inf*inf);
	dp[0] = 0;
	for (int i = 0; i < v; i++) {
	    for (int j = 0; j < n; j++) {
		if (i + j + 1 <= v) {
		    dp[i+j+1] = min(dp[i+j+1], dp[i] + sum[j]);
		}
	    }
	}
	res += dp[v];
	return res;
    }
}

int main() {
    /*
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);
    */

    int n;
    ll v;
    scanf("%d%lld", &n, &v);
    printf("%lld\n", solve(n, v));
}